PSPACE - PDFSEARCH.IO - Document Search Engine

PSPACE
Results: 62

#	Item
1	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 Add to Reading List Source URL: qav.comlab.ox.ac.uk Language: English - Date: 2015-12-10 11:06:15 Temporal logic Mathematics Mathematical analysis Theoretical computer science Linear temporal logic Computation tree logic IP Symbol Distribution Craig interpolation Universal representation
2	Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin1, 2 Alain Finkel1 Add to Reading List Source URL: www7.in.tum.de Language: English - Date: 2016-09-23 11:33:03
3	Subway Shuffle is PSPACE–complete (Preliminary draft) Marzio De Biasi∗ Tim Ophelders† Add to Reading List Source URL: www.nearly42.org Language: English - Date: 2015-04-17 16:11:52
4	Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances Paul Bonsma∗ Institut f¨ ur Mathematik, Sekr. MA 6-1, Technische Universit¨at Berlin, Add to Reading List Source URL: www.cdam.lse.ac.uk Language: English - Date: 2017-04-12 10:30:42
5	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 Add to Reading List Source URL: www7.in.tum.de Language: English - Date: 2016-09-23 11:32:15
6	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester Add to Reading List Source URL: www.bedewell.com Language: English - 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
7	The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-06-03 07:34:14 Computational complexity theory Complexity classes Theory of computation FO PSPACE IP NP P Reduction Homomorphism SO
8	On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing Add to Reading List Source URL: korrekt.org Language: English - Date: 2016-06-13 07:14:39 Computational complexity theory Finite automata Complexity classes Theory of computation Nondeterministic finite automaton Regular language PSPACE Bchi automaton FO Permutation IP Structure
9	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-02-25 05:09:48 Computational complexity theory Complexity classes IP Proof of knowledge NP Soundness Interactive proof system PSPACE Zero-knowledge proof Probabilistic complexity theory Mathematical proof Quadratic residue
10	LNCSParallel Repetition of Computationally Sound Protocols Revisited Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:49:12 Computational complexity theory Theory of computation Cryptography Complexity classes Quantum complexity theory IP Proof of knowledge NP PP XTR PSPACE Communications protocol