PSPACE-complete - PDFSEARCH.IO - Document Search Engine

PSPACE-complete
Results: 41

#	Item
21	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Polygons Euclidean plane geometry 3D computer graphics Simple polygon PSPACE-complete Vertex Hex True quantified Boolean formula Polyhedron Games Geometry Theoretical computer science
22	Space and energy efficient computation with DNA strand displacement systems Chris Thachuk and Anne Condon Department of Computer Science, University of British Columbia, Vancouver, BC, Canada Abstract. Chemical reaction Add to Reading List Source URL: www-devel.cs.ubc.ca Language: English - Date: 2012-06-17 22:22:27 Complexity classes True quantified Boolean formula NL Reversible computing PSPACE-complete PP DSPACE IP Computation Theoretical computer science Computational complexity theory Applied mathematics
23	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the parameterized complexity of a generalized Rush Hour puzzle ∗ H. Fernau† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:31 Puzzles Rush Hour Parameterized complexity PSPACE-complete Polynomial P Games Complexity classes Mechanical puzzles
24	Parameterized Regular Expressions and Their Languages Pablo Barceló1 , Leonid Libkin2 , and Juan L. Reutter2 1 2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2011-09-27 14:42:30 Applied mathematics Automata theory EXPSPACE Regular language Regular expression Model theory PSPACE-complete FO Symbol Theoretical computer science Formal languages Complexity classes
25	REACHABILITY IN TWO-DIMENSIONAL VECTOR ADDITION SYSTEMS WITH STATES IS PSPACE-COMPLETE arXiv:1412.4259v1 [cs.FL] 13 Dec,‡,§ , CHRISTOPH HAASE2,†,§ , Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2015-04-13 05:39:26 Petri net Reachability FO Applied mathematics Computer science Theoretical computer science Concurrency Diagrams
26	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) PSpace Tableau Algorithms for Acyclic Modalized ALC Jia Tao · Giora Slutzki · Vasant Honavar Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2011-06-14 00:05:06 Model theory Philosophical logic Automated theorem proving Method of analytic tableaux Abox Structure Boolean satisfiability problem PSPACE-complete Modal logic Theoretical computer science Mathematical logic Mathematics
27	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 Complexity classes Applied mathematics Nondeterministic finite automaton Deterministic finite automaton Lookahead PSPACE-complete NP Theoretical computer science Automata theory Models of computation
28	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 PSPACE-complete NP Regular language Deterministic finite automaton P FO Linear temporal logic Book:Theory Of Computation Theoretical computer science Complexity classes Applied mathematics
29	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 Theory of computation Models of computation PSPACE-complete Non-deterministic Turing machine Cryptographic nonce Configuration Theoretical computer science Turing machine Applied mathematics
30	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 Complexity classes Logic gates Finite model theory Boolean algebra True quantified Boolean formula Flip-flop PSPACE-complete FO IP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE