PSPACE

Results: 62



#Item
41Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany Abstract

Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany Abstract

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2014-02-07 10:22:52
42Complex systems theory / Complexity / PR / RL / PSPACE / Science / Structure / Complexity classes / Applied mathematics / MAJC

Appendix 3: AR-DRG Version 8.0 Descriptions Code Long Description Short Description 801A OR Procedures Unrelated to Principal Diagnosis, Major Complexity

Add to Reading List

Source URL: ihpa.gov.au

Language: English - Date: 2015-03-29 18:54:42
43FIRE: Interactive Visual Support for Parameter Space-Driven Rule Mining∗ Abhishek Mukherji, Xika Lin, Jason Whitehouse, Christopher R. Botaish, Elke A. Rundensteiner and Matthew O. Ward Computer Science Department, Wor

FIRE: Interactive Visual Support for Parameter Space-Driven Rule Mining∗ Abhishek Mukherji, Xika Lin, Jason Whitehouse, Christopher R. Botaish, Elke A. Rundensteiner and Matthew O. Ward Computer Science Department, Wor

Add to Reading List

Source URL: davis.wpi.edu

Language: English - Date: 2013-08-11 23:24:29
44Matching Trace Patterns with Regular Policies Franz Baader1, , Andreas Bauer2 , and Alwen Tiu2 1 TU Dresden, Germany [removed] 2

Matching Trace Patterns with Regular Policies Franz Baader1, , Andreas Bauer2 , and Alwen Tiu2 1 TU Dresden, Germany [removed] 2

Add to Reading List

Source URL: www.immerundewig.at

Language: English - Date: 2009-04-14 20:01:26
45Journal of Artificial Intelligence Research[removed]432 Submitted 07/08; published[removed]The Computational Complexity of Dominance and Consistency in CP-Nets

Journal of Artificial Intelligence Research[removed]432 Submitted 07/08; published[removed]The Computational Complexity of Dominance and Consistency in CP-Nets

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2008-11-25 12:36:17
46QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract

QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2006-11-24 03:53:50
47On Applications of the Equilibrium Value Method Serena Booth December 12th, 2014 Abstract In 2010, Jain et al. [JJUW10] provided the first proof that QIP = PSPACE. Jain et al. used a

On Applications of the Equilibrium Value Method Serena Booth December 12th, 2014 Abstract In 2010, Jain et al. [JJUW10] provided the first proof that QIP = PSPACE. Jain et al. used a

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2014-12-25 20:29:00
48Some Results on the Complexity of Planning with Incomplete Information Patrik Haslum and Peter Jonsson Department of Computer and Information Science Linkoping University, S[removed]Linkoping, Sweden fpahas,petejg@ida.l

Some Results on the Complexity of Planning with Incomplete Information Patrik Haslum and Peter Jonsson Department of Computer and Information Science Linkoping University, S[removed]Linkoping, Sweden fpahas,petejg@ida.l

Add to Reading List

Source URL: www.ida.liu.se

Language: English - Date: 2012-02-01 04:29:17
49Bounded memory Dolev-Yao adversaries in collaborative systems Max Kanovich1 , Tajana Ban Kirigin2 , Vivek Nigam3 , and Andre Scedrov3 1 Queen Mary, University of London, UK

Bounded memory Dolev-Yao adversaries in collaborative systems Max Kanovich1 , Tajana Ban Kirigin2 , Vivek Nigam3 , and Andre Scedrov3 1 Queen Mary, University of London, UK

Add to Reading List

Source URL: bib.irb.hr

Language: English - Date: 2010-09-30 13:57:08
50The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications Robert A. Hearn1 and Erik D. Demaine2 1 Artificial Intelligence Laboratory, Massachusetts Institute of Technology,

The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications Robert A. Hearn1 and Erik D. Demaine2 1 Artificial Intelligence Laboratory, Massachusetts Institute of Technology,

Add to Reading List

Source URL: groups.csail.mit.edu

Language: English - Date: 2002-07-31 20:05:58