LNCSParallel Repetition of Computationally Sound Protocols Revisited

First Page		Document Content
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		LNCSParallel Repetition of Computationally Sound Protocols Revisited Add to Reading List Source URL: www.nada.kth.se Download Document from Source Website File Size: 551,89 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