Simulation Over One-counter Nets is PSPACE-Complete ∗ Piotr Hofman1 , Sławomir Lasota1 , Richard Mayr2 , and Patrick Totzke2 1 University of Warsaw, Poland

Source URL: www.mimuw.edu.pl

February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass

Source URL: www.cs.cornell.edu

• 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

Lemmings Is PSPACE-Complete Giovanni Viglietta University of Ottawa, Canada, Abstract. Lemmings is a computer puzzle game developed by DMA

Source URL: giovanniviglietta.com

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

Source URL: giovanniviglietta.com

An Implicit Characterization of PSPACE Marco Gaboardi Dipartimento di Scienze dell’Informazione, Universit`a degli Studi di Bologna - Mura Anteo Zamboni 7, 40127 Bologna, Italy, and Jean-Yves Mario

Source URL: www.cs.unibo.it

PDF Document

Source URL: www.cs.swan.ac.uk

• Complexity classes
• Theory of computation
• Theoretical computer science
• Mathematics
• FO
• PSPACE
• P
• Recursion
• EXPTIME
• Low

No proof nets for MLL with units Proof equivalence in MLL is PSPACE•complete Willem Heijltjes∗ and Robin Houston∗∗

Source URL: www.cs.bath.ac.uk

BRICS RSJ. M. Byskov: Maker-Maker and Maker-Breaker Games are PSPACE-Complete BRICS Basic Research in Computer Science

Source URL: www.brics.dk

Push-2-F is PSPACE-Complete Erik D. Demaine∗ Robert A. Hearn† Michael Hoffmann‡

Source URL: groups.csail.mit.edu

Fixed-Parameter Hierarchies inside PSPACE Guoqiang Pan Department of Computer Science Rice University

Source URL: www.cs.rice.edu