Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

First Page		Document Content
Date: 2009-11-10 10:57:12 Computational complexity theory Logic Complexity classes Mathematical logic PSPACE FO Second-order logic P versus NP problem Constraint satisfaction problem NP P Constraint satisfaction		Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester Add to Reading List Source URL: www.bedewell.com Download Document from Source Website File Size: 942,69 KB Share Document on Facebook

	Model Checking Probabilistic Knowledge: A PSPACE Case Xiaowei Huang and Marta Kwiatkowska University of Oxford, UK Abstract Model checking probabilistic knowledge of memoryful semantics is undecidable, even for a simple DocID: 1xVvn - View Document
	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin1, 2 Alain Finkel1 DocID: 1vlLP - View Document
	Subway Shuffle is PSPACE–complete (Preliminary draft) Marzio De Biasi∗ Tim Ophelders† DocID: 1viyb - View Document
	Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances Paul Bonsma∗ Institut f¨ ur Mathematik, Sekr. MA 6-1, Technische Universit¨at Berlin, DocID: 1uVHn - View Document
	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin∗†‡ , Alain Finkel†§ , Stefan G¨oller†¶k , Christoph Haase†§k and Pierre McKenzie∗†∗∗ ∗ DIRO DocID: 1uHDR - View Document