PSPACE-complete - PDFSEARCH.IO - Document Search Engine

PSPACE-complete
Results: 41

#	Item
11	Partial Searchlight Scheduling is Strongly PSPACE-complete Giovanni Viglietta∗ in 2-EXP. Whether SSP is NP-hard or even in NP is left in [2] as an open problem. More recently, in [4], the author introduced the Add to Reading List Source URL: giovanniviglietta.com Language: English - Date: 2013-05-16 16:45:32
12	Lemmings Is PSPACE-Complete Giovanni Viglietta University of Ottawa, Canada, Abstract. Lemmings is a computer puzzle game developed by DMA Add to Reading List Source URL: giovanniviglietta.com Language: English - Date: 2015-03-08 22:07:32
13	Simulation Over One-counter Nets is PSPACE-Complete ∗ Piotr Hofman1 , Sławomir Lasota1 , Richard Mayr2 , and Patrick Totzke2 1 University of Warsaw, Poland Add to Reading List Source URL: www.mimuw.edu.pl Language: English - Date: 2014-04-01 04:10:08
14	February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-04 17:20:26 Computational complexity theory Complexity classes Theory of computation Polynomial hierarchy P versus NP problem IP True quantified Boolean formula NP PP Oracle machine PSPACE-complete Polynomial-time reduction
15	Lemmings Is PSPACE-Complete Giovanni Viglietta University of Ottawa, Canada, Abstract. Lemmings is a computer puzzle game developed by DMA Add to Reading List Source URL: giovanniviglietta.com Language: English - Date: 2014-09-30 22:24:24
16	Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ all possible schedules has been shown to be discretizable and reducible to a finite graph, which can be explored systematically to find a s Add to Reading List Source URL: giovanniviglietta.com Language: English - Date: 2013-06-13 22:40:09
17	No proof nets for MLL with units Proof equivalence in MLL is PSPACE•complete Willem Heijltjes∗ and Robin Houston∗∗ Add to Reading List Source URL: www.cs.bath.ac.uk Language: English - Date: 2014-07-19 19:28:17
18	BRICS RSJ. M. Byskov: Maker-Maker and Maker-Breaker Games are PSPACE-Complete BRICS Basic Research in Computer Science Add to Reading List Source URL: www.brics.dk - Date: 2004-09-14 04:29:07
19	Push-2-F is PSPACE-Complete Erik D. Demaine∗ Robert A. Hearn† Michael Hoffmann‡ Add to Reading List Source URL: groups.csail.mit.edu - Date: 2002-07-31 20:06:05
20	Proceedings of the 6th Annual North American Conference on AI and Simulation in Games (GAMEON-NA), pp. 5-12, PROCEDURAL GENERATION OF SOKOBAN LEVELS Joshua Taylor and Ian Parberry Dept. of Computer Science & Engin Add to Reading List Source URL: larc.unt.edu Language: English - Date: 2011-09-22 17:21:08 Application software Windows games Linux games Logic puzzles ZX Spectrum games Sokoban LIT Procedural generation PSPACE-complete Puzzle video games Digital media Games

UPDATE