PSPACE - PDFSEARCH.IO - Document Search Engine

PSPACE
Results: 62

#	Item
11	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
12	The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K. Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2013-10-30 13:41:09 Computational complexity theory Complexity classes Theory of computation PPAD Reduction LemkeHowson algorithm Algorithm NP PSPACE-complete P True quantified Boolean formula
13	Constraint Satisfaction with Counting Quantifiers⋆ Florent Madelaine1 , Barnaby Martin2⋆⋆ and Juraj Stacho3⋆ ⋆ ⋆ 2 Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2012-03-15 13:21:54 Computational complexity theory Logic Complexity classes Abstraction Metalogic Predicate logic Finite model theory IP FO Quantifier PSPACE-complete Model theory
14	J. Cryptol: 116–135 DOI: s00145x Parallel Repetition of Computationally Sound Protocols Revisited∗ Krzysztof Pietrzak Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 09:00:34 Complexity classes Cryptography Computational complexity theory Proof of knowledge IP Quantum complexity theory Soundness NP Commitment scheme PSPACE PP Security parameter
15	QCSP on partially reflexive forests Barnaby Martin Algorithms and Complexity in Durham, Durham University, U.K. CP 2011, Perugia. 14th August 2011. Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-09-13 17:39:08 Complexity classes NP-hardness IP PSPACE-complete NP Reduction PSPACE P FO Circuits over sets of natural numbers True quantified Boolean formula
16	CONSTRAINT SATISFACTION WITH COUNTING QUANTIFIERS BARNABY MARTIN ∗† , FLORENT MADELAINE Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2015-03-30 10:49:56 Complexity classes IP FO PSPACE-complete PSPACE Interpretation NP Quantifier Well-formed formula Generalized geography Linear temporal logic
17	1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-24 10:52:24 Complexity classes PSPACE-complete IP Generalized geography PSPACE PP ArthurMerlin protocol Computational complexity theory NP P NEXPTIME Reduction
18	On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms Fabien Teytaud and Olivier Teytaud Abstract—Monte-Carlo Tree Search (MCTS) algorithms, including upper confidence Bounds (UCT), have very good Add to Reading List Source URL: game.itu.dk Language: English - Date: 2010-08-12 04:56:00 Abstract strategy games Havannah Monte Carlo tree search Hex TwixT PSPACE-complete Computer Go Board game Star Game of the Amazons General game playing Strategy-stealing argument
19	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
20	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