PSPACE-complete - PDFSEARCH.IO - Document Search Engine

PSPACE-complete
Results: 41

#	Item
1	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
2	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
3	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
4	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
5	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
6	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
7	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
8	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
9	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
10	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