Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
18 | Rahul Jain 0001, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous |
QIP = PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 53(12), pp. 102-109, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Philipp Hertel, Toniann Pitassi |
The PSPACE-Completeness of Black-White Pebbling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 39(6), pp. 2622-2682, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Stanislav Böhm, Stefan Göller, Petr Jancar |
Bisimilarity of One-Counter Processes Is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings, pp. 177-191, 2010, Springer, 978-3-642-15374-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Alexander Rabinovich |
Temporal Logics over Linear Time Domains Are in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings, pp. 29-50, 2010, Springer, 978-3-642-15348-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Mila E. Majster-Cederbaum, Nils Semmelrock |
Reachability in Tree-Like Component Systems is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FACS@FMWeek ![In: Proceedings of the 6th International Workshop on Formal Aspects of Component Software, FACS@FMWeek 2009, Eindhoven, The Netherlands, November 2-3, 2009, pp. 197-210, 2009, Elsevier. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Paul S. Bonsma, Luis Cereceda |
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(50), pp. 5215-5226, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Simone Bova, Franco Montagna |
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(12-13), pp. 1143-1158, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Rahul Jain 0001, Sarvagya Upadhyay, John Watrous |
Two-message quantum interactive proofs are in PSPACE ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0905.1300, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
18 | Rahul Jain 0001, Sarvagya Upadhyay, John Watrous |
Two-Message Quantum Interactive Proofs Are in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 534-543, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Quantum interactive proof systems, matrix multiplicative weights update method, quantum complexity |
18 | Kyle W. Burke, Shang-Hua Teng |
Atropos: A PSPACE-Complete Sperner Triangle Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Math. ![In: Internet Math. 5(4), pp. 477-492, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Yasuhiko Takenaga, Shigeru Arai |
PSPACE-completeness of an escape problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 108(4), pp. 229-233, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Isabel Oitavem |
Characterizing PSPACE with pointers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 54(3), pp. 323-329, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Bernd Borchert |
Formal Language Characterizations of P, NP, and PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Lang. Comb. ![In: J. Autom. Lang. Comb. 13(3/4), pp. 161-183, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Pawel Wocjan, Dominik Janzing, Thomas Decker 0002 |
Measuring 4-local qubit observables could probabilistically solve PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 8(8), pp. 741-755, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Benedek Nagy, Sándor Vályi |
Interval-valued computations and their connection with PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 394(3), pp. 208-222, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Lutz Schröder, Dirk Pattinson |
The craft of model making: PSPACE bounds for non-iterative modal logics ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0802.0116, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Dariusz Dereniowski |
Phutball is PSPACE-hard ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0804.1777, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Franz Baader, Jan Hladik, Rafael Peñaloza |
Automata can show PSpace results for description logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 206(9-10), pp. 1045-1056, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Mila E. Majster-Cederbaum, Christoph Minnameier |
Everything Is PSPACE-Complete in Interaction Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings, pp. 216-227, 2008, Springer, 978-3-540-85761-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Ilya Shapirovsky |
PSPACE-decidability of Japaridze's polymodal logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 7, papers from the seventh conference on `Advances in Modal Logic,` held in Nancy, France, 9-12 September 2008, pp. 289-304, 2008, College Publications, 978-1-904987-68-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Paul Gastin, Dietrich Kuske |
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 80(1-3), pp. 169-197, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
18 | Aduri Pavan, Fengming Wang |
Robustness of PSPACE-complete sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 103(3), pp. 102-104, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Petr Sosík, Alfonso Rodríguez-Patón |
Membrane computing and complexity theory: A characterization of PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 73(1), pp. 137-152, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Mihaly Mezei, Ming-Ming Zhou |
Pspace: a program that assesses protein space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Source Code Biol. Medicine ![In: Source Code Biol. Medicine 2, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Philipp Hertel, Toniann Pitassi |
Black-White Pebbling is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR07, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
18 | Lutz Schröder, Dirk Pattinson |
PSPACE Bounds for Rank-1 Modal Logics ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0706.4044, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
18 | Matthew Delacorte |
Graph Isomorphism is PSPACE-complete ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0708.4075, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
18 | Joseph Y. Halpern, Leandro Chaves Rêgo |
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 17(4), pp. 795-806, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Carsten Lutz, Dirk Walther 0002, Frank Wolter |
Quantitative temporal logics over the reals: PSpace and below. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 205(1), pp. 99-123, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Franz Baader, Jan Hladik, Rafael Peñaloza |
SI! Automata Can Show PSPACE Results for Description Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., pp. 67-78, 2007, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
18 | Joost Winter |
Is P = PSPACE for Infinite Time Turing Machines? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILC ![In: Infinity in Logic and Computation, International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers, pp. 126-137, 2007, Springer, 978-3-642-03091-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Franz Baader, Jan Hladik, Rafael Peñaloza |
Blocking Automata for PSPACE DLs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 2007 International Workshop on Description Logics (DL2007), Brixen-Bressanone, near Bozen-Bolzano, Italy, 8-10 June, 2007, 2007, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
18 | Joseph Y. Halpern, Leandro Chaves Rêgo |
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 2306-2311, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
18 | Sven Grothklags, Ulf Lorenz |
Stochastic Airline Fleet Assignment is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 25, pp. 67-68, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Dimitris Fotakis 0001, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis |
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 4(3), pp. 433-454, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Joseph Y. Halpern, Leandro Chaves Rêgo |
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0603019, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
18 | Jan Hladik, Rafael Peñaloza |
PSPACE Automata for Description Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 2006 International Workshop on Description Logics (DL2006), Windermere, Lake District, UK, May 30 - June 1, 2006, 2006, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
18 | Alan Skelley |
Theories and proof systems for PSPACE and the EXP-time hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2006 |
RDF |
|
18 | Robert A. Hearn, Erik D. Demaine |
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 343(1-2), pp. 72-96, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Scott Aaronson |
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Scott Aaronson |
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/quant-ph/0510230, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Robert A. Hearn |
Amazons is PSPACE-complete ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0502013, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Paolo Liberatore |
Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0503043, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Volker Diekert, Claudio Gutierrez 0001, Christian Hagenah |
The existential theory of equations with rational constraints in free groups is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 202(2), pp. 105-140, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro |
Generalized Amazons is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August 5, 2005, pp. 132-137, 2005, Professional Book Center, 0938075934. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Stephen A. Fenner, Stuart A. Kurtz, James S. Royer |
Every polynomial-time 1-degree collapses if and only if P = PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 69(3), pp. 713-741, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Ilya Shapirovsky |
On PSPACE-decidability in Transitive Modal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 5, papers from the fifth conference on `Advances in Modal logic,` held in Manchester, UK, 9-11 September 2004, pp. 269-287, 2004, King's College Publications, 1-904987-22-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
18 | Artiom Alhazov, Carlos Martín-Vide, Linqiang Pan |
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 58(2), pp. 67-77, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Kurt Rohloff, Tae-Sic Yoo, Stéphane Lafortune |
Deciding co-observability is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Autom. Control. ![In: IEEE Trans. Autom. Control. 48(11), pp. 1995-1999, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | John Watrous |
PSPACE has constant-round quantum interactive proof systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 292(3), pp. 575-588, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Philippe Moser |
RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR03, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Olivier Powell |
PSPACE contains almost complete problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR03, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Evgeny Dantsin, Alexander Wolpert |
A Robust Dna Computation Model That Captures Pspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 14(5), pp. 933-, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Paul Gastin, Dietrich Kuske |
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings, pp. 218-232, 2003, Springer, 3-540-40753-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Yevgeny Kazakov, Hans de Nivelle |
Subsumption of Concepts in FL0y for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 2003 International Workshop on Description Logics (DL2003), Rome, Italy September 5-7, 2003, 2003, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Wolfgang Slany |
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 289(1), pp. 829-843, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Gary William Flake, Eric B. Baum |
Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 270(1-2), pp. 895-911, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Robert A. Hearn, Erik D. Demaine |
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.CC/0205005, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
18 | Carsten Lutz |
PSpace Reasoning with the Description Logic ALCF(D). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 10(5), pp. 535-568, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Maria I. Andreou, Dimitris Fotakis 0001, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis |
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 81-92, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Alexander V. Chagrov, Mikhail N. Rybakov |
How Many Variables Does One Need to Prove PSPACE-hardness of Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 4, papers from the fourth conference on `Advances in Modal logic,` held in Toulouse, France, 30 September - 2 October 2002, pp. 71-82, 2002, King's College Publications, 0-9543006-2-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
18 | Erik D. Demaine, Robert A. Hearn, Michael Hoffmann 0001 |
Push-2-f is pspace-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 14th Canadian Conference on Computational Geometry, University of Lethbridge, Alberta, Canada, August 12-14, 2002, pp. 31-35, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
18 | Ke Yang 0005 |
Integer Circuit Evaluation Is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 63(2), pp. 288-303, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Volker Diekert, Claudio Gutierrez 0001, Christian Hagenah |
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.DS/0103018, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
18 | Stephan Tobies |
PSPACE Reasoning for Graded Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 11(1), pp. 85-106, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Manfred Schmidt-Schauß |
Stratified Context Unification Is in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 498-512, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | Stéphane Demri |
The Nondeterministic Information Logic NIL is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 42(3-4), pp. 211-234, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil |
PSPACE-complete problems for subgroups of free groups and inverse finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 242(1-2), pp. 247-281, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Ke Yang |
Integer Circuit Evaluation is PSPACE-complete ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR00, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
18 | Stephan Tobies |
PSPACE Reasoning for Graded Modal Logics ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.LO/0005009, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
18 | Ron van der Meyden |
Predicate Boundedness of Linear Monadic Datalog is in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 11(4), pp. 591-612, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Stéphane Demri |
Modal Logics with Weak Forms of Recursion: PSPACE Specimens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 3, papers from the third conference on `Advances in Modal logic,` held in Leipzig, Germany, 4-7 October 2000, pp. 113-138, 2000, World Scientific, 981-238-179-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Claudio Gutierrez 0001 |
Satisfiability of equations in free groups is in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, pp. 21-27, 2000, ACM, 1-58113-184-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
18 | Peter Jonsson |
Strong bounds on the approximability of two Pspace-hard problems in propositional planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 26(1-4), pp. 133-147, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Guy Perrier |
A PSPACE-complete Fragment of Second-order Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 224(1-2), pp. 267-289, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | John Watrous |
PSPACE has 2-round quantum interactive proof systems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.CC/9901015, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
18 | Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan |
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.CC/9809064, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
18 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns |
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 26(2), pp. 238-274, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan |
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 27(5), pp. 1237-1261, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | L. Bernátsky |
Regular Expression Star-Freeness is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Cybern. ![In: Acta Cybern. 13(1), pp. 1-21, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
18 | Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor |
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Chic. J. Theor. Comput. Sci. ![In: Chic. J. Theor. Comput. Sci. 1995, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
18 | Alexander Russell, Ravi Sundaram |
The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 53(2), pp. 61-68, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows |
Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 73(3), pp. 235-276, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Anne Condon |
Approximate solutions to problems in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 26(2), pp. 4-13, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Shigeki Iwata, Takumi Kasai |
The Othello game on an n*n board is PSPACE-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 123(2), pp. 329-340, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Jin-yi Cai, Anne Condon, Richard J. Lipton |
PSPACE Is Provable by Two Provers in One Round. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 48(1), pp. 183-193, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi |
The complexity of approximating PSPACE-Complete problems for hierarchical specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/math/9409225, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
18 | Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi |
The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nord. J. Comput. ![In: Nord. J. Comput. 1(3), pp. 275-316, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP BibTeX RDF |
|
18 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns |
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 424-435, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani |
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pp. 459-467, 1994, ACM, 0-89791-663-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan |
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pp. 468-477, 1994, ACM, 0-89791-663-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Juris Hartmanis, Richard Chang 0001, Desh Ranjan, Pankaj Rohatgi |
On IP = PSPACE and Theorems with Narrow Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Current Trends in Theoretical Computer Science ![In: Current Trends in Theoretical Computer Science - Essays and Tutorials, pp. 484-493, 1993, World Scientific, 978-981-02-1462-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor |
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 305-314, 1993, ACM, 0-89791-591-7. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Osamu Watanabe 0001, Shouwen Tang |
On Polynomial-Time Turing and Many-One Completeness in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 97(2), pp. 199-215, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
18 | Sang Cho, Dung T. Huynh |
Finite-Automaton Aperiodicity is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 88(1), pp. 99-116, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
18 | Jin-yi Cai, Merrick L. Furst |
PSPACE Survives Constant-Width Bottlenecks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 2(1), pp. 67-76, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
18 | Jin-yi Cai, Anne Condon, Richard J. Lipton |
PSPACE Is Provable By Two Provers In One Round. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991, pp. 110-115, 1991, IEEE Computer Society, 0-8186-2255-5. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
18 | Jin-yi Cai |
With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 38(1), pp. 68-85, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
18 | Stephen A. Fenner, Stuart A. Kurtz, James S. Royer |
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 624-629, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
equivalent sets, m-reducible, Karp-reducible, polynomial-time computable function |
18 | Osamu Watanabe 0001, Shouwen Tang |
On Polynomial Time Turing and Many-One Completeness in PSPACE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings: Fourth Annual Structure in Complexity Theory Conference, University of Oregon, Eugene, Oregon, USA, June 19-22, 1989, pp. 15-23, 1989, IEEE Computer Society, 0-8186-1958-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|