The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase PSPACE-complete (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1978-1990 (15) 1991-1994 (22) 1995-1998 (17) 1999 (16) 2000 (17) 2001 (16) 2002 (16) 2003 (16) 2004 (15) 2005 (30) 2006 (26) 2007 (30) 2008 (22) 2009 (18) 2010-2012 (15) 2013-2014 (24) 2015-2016 (17) 2017-2020 (23) 2021-2023 (20) 2024 (4)
Publication types (Num. hits)
article(118) inproceedings(261)
Venues (Conferences, Journals, ...)
CoRR(38) FSTTCS(14) STACS(14) MFCS(13) ICALP(12) Theor. Comput. Sci.(12) CSL(11) LICS(11) CONCUR(10) FoSSaCS(10) Theory Comput. Syst.(10) LPAR(8) FOCS(6) CAV(5) J. ACM(5) STOC(5) More (+10 of total 137)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 173 occurrences of 124 keywords

Results
Found 379 publication records. Showing 379 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
65Robert A. Hearn, Erik D. Demaine The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
58Stéphane Demri, Denis Lugiez Presburger Modal Logic Is PSPACE-Complete. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
56Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou Inclusion Dependencies and Their Interaction with Functional Dependencies. Search on Bibsonomy PODS The full citation details ... 1982 DBLP  DOI  BibTeX  RDF relational database, functional dependency, PSPACE-complete, inclusion dependency, complete axiomatization
56Joachim Niehren, Martin Müller 0001, Jean-Marc Talbot Entailment of Atomic Set Constraints is PSPACE-Complete. Search on Bibsonomy LICS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
56Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
51Keijo Heljanko Model Checking with Finite Complete Prefixes Is PSPACE-Complete. Search on Bibsonomy CONCUR The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
46Marcel Crâsmaru, John Tromp Ladders Are PSPACE-Complete. Search on Bibsonomy Computers and Games The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
46Marcus Schaefer 0001 Deciding the K-Dimension is PSPACE-Complete. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF computational complexity, learning theory, PSPACE
46Ke Yang Integer Circuit Evaluation is PSPACE-Complete. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Integer Circuit, Chinese Remainder Theorem, PSPACE
44Paul S. Bonsma, Luis Cereceda Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF vertex-recolouring, colour graph, superpolynomial distance, PSPACE-complete
42Thomas Eiter, Georg Gottlob On the Complexity of Theory Curbing. Search on Bibsonomy LPAR The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Krishnendu Chatterjee Stochastic Müller Games are PSPACE-Complete. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke Solutions to Real-World Instances of PSPACE-Complete Stacking. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Kyle W. Burke, Shang-Hua Teng A PSPACE-complete Sperner Triangle Game. Search on Bibsonomy WINE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Volker Diekert, Claudio Gutierrez 0001, Christian Hagenah The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF free group, Formal languages, regular language, equations
37Stefan Dziembowski Bounded-Variable Fixpoint Queries are PSPACE-complete. Search on Bibsonomy CSL The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
37Erez Petrank, Gábor Tardos On the Knowledge Complexity of NP. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 68Q15, 68Q17
37Edith Hemaspaandra The Complexity of Poor Man's Logic. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
34Laura Bozzelli, Salvatore La Torre Decision Problems for Lower/Upper Bound Parametric Timed Automata. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Guoqiang Pan, Moshe Y. Vardi Fixed-Parameter Hierarchies inside PSPACE. Search on Bibsonomy LICS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Kurt Rohloff, Stéphane Lafortune PSPACE-completeness of Modular Supervisory Control Problems*. Search on Bibsonomy Discret. Event Dyn. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF computational complexity, verification, supervisory control, modular systems
34Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. Search on Bibsonomy ICALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
32Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Search on Bibsonomy ICALP (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
32Stéphane Demri LTL over Integer Periodicity Constraints: (Extended Abstract). Search on Bibsonomy FoSSaCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32Christof Löding, Philipp Rohde Solving the Sabotage Game Is PSPACE-Hard. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Marcin Rychlik On Probabilistic Quantified Satisfability Games. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao 0002, Thomas A. Henzinger, Jens Palsberg Stack Size Analysis for Interrupt-Driven Programs. Search on Bibsonomy SAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan The Guarding Problem - Complexity and Approximation. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF QBF (Quantified Boolean Formula), QSAT (Quantified Satisfiability), Approximation Algorithms, PSPACE-complete
32Monika Maidl The Common Fragment of CTL and LTL. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF action-based computation tree logic, linear time logic, common fragment, ACTL formulas, PSPACE-complete problem, path quantifiers, 1-weak Buchi automaton, automaton size, formula size, computational complexity, temporal logic, trees (mathematics), decidability, finite automata, expressive power, negation, CTL, LTL, inductive definition
32Costas Courcoubetis, Mihalis Yannakakis The Complexity of Probabilistic Verification. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF EXPTIME-complete, model checking, temporal logic, Markov chain, automata, probabilistic algorithm, PSPACE-complete
32Rajeev Alur, Thomas A. Henzinger Back to the Future: Towards a Theory of Timed Regular Languages Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF theory of timed regular languages, two-way timed automata, temporal logic, undecidability, boolean operations, PSPACE-complete
32Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar Decision Problems for Propositional Linear Logic Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF noncommutative propositional linear logic, propositional linear logic, multiplicative fragment, unrestricted weakening, NP-completeness, undecidability, decision problem, PSPACE-complete
32Xiaotie Deng, Christos H. Papadimitriou Exploring an Unknown Graph (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF unknown graph exploration, strongly connected graph, Eulerian graphs, bounded ratio, directed graph, PSPACE-complete, worst-case ratio
30Stéphane Demri, Alexander Rabinovich The Complexity of Temporal Logic with Until and Since over Ordinals. Search on Bibsonomy LPAR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Paul Hunter, Anuj Dawar Complexity Bounds for Regular Games. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe 0001 Games with a Uniqueness Property. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
30Hing Leung On Finite Automata with Limited Nondeterminism. Search on Bibsonomy Acta Informatica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
30David Lichtenstein, Michael Sipser GO Is Polynomial-Space Hard. Search on Bibsonomy J. ACM The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
29Salvatore La Torre, Gennaro Parlato On the Complexity of LtlModel-Checking of Recursive State Machines. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29John H. Reif, Sudheer Sahu, Peng Yin 0003 Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems. Search on Bibsonomy DNA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Stephen D. Travers The Complexity of Membership Problems for Circuits over Sets of Integers. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Alexander Rabinovich Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities. Search on Bibsonomy FORMATS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer The Complexity of Generalized Satisfiability for Linear Temporal Logic. Search on Bibsonomy FoSSaCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, linear temporal logic
27Wiebe van der Hoek, Alessio Lomuscio, Michael J. Wooldridge On the complexity of practical ATL model checking. Search on Bibsonomy AAMAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF verification, complexity, cooperation, logic
27Rajeev Alur, Salvatore La Torre Deterministic generators and games for Ltl fragments. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Games, Temporal Logic, Automata
25Chao Yang, Zhujun Zhang Friends-and-strangers is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
25Chao Yang, Zhujun Zhang Atropos-k is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
25Jose Balanza-Martinez, Angel A. Cantu, Robert T. Schweller, Tim Wylie A Simple Proof that Ricochet Robots is PSPACE-Complete. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
25Sophie Hao Universal Generation for Optimality Theory Is PSPACE-Complete. Search on Bibsonomy Comput. Linguistics The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
25Md Lutfar Rahman, Thomas Watson 0001 6-Uniform Maker-Breaker Game is PSPACE-Complete. Search on Bibsonomy Comb. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Jan Philipp Wächter, Armin Weiß An Automaton Group with PSPACE-Complete Word Problem. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Laure Daviaud, David Purser The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono 0001 Turning Tiles is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar, Paritosh K. Pandya Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Thomas Depian, Christoph Kern, Sebastian Röder, Soeren Terziadis, Markus Wallinger Network Navigation with Online Delays is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Laure Daviaud, David Purser The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). Search on Bibsonomy LICS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Valentin Gledel, Nacim Oijid Avoidance Games Are PSPACE-Complete. Search on Bibsonomy STACS The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar, Paritosh K. Pandya Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete. Search on Bibsonomy CONCUR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
25Lear Bahack The Game of Tumbleweed is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
25Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems. Search on Bibsonomy ACM Trans. Comput. Theory The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
25Austin Luchsinger Brief Announcement: Barrier-1 Reachability for Thermodynamic Binding Networks Is PSPACE-Complete. Search on Bibsonomy SAND The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
25Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer 0001, Soham Chakraborty 0001 Parameterized Verification under Release Acquire is PSPACE-complete. Search on Bibsonomy PODC The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
25Bosheng Song, Xiangxiang Zeng Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division. Search on Bibsonomy J. Membr. Comput. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
25Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken Dots & Boxes is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
25Erik D. Demaine, Yevhenii Diomidov Strings-and-Coins and Nimstring are PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
25David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete. Search on Bibsonomy ESA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
25Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken Dots & Boxes Is PSPACE-Complete. Search on Bibsonomy MFCS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
25Md Lutfar Rahman, Thomas Watson 0001 6-Uniform Maker-Breaker Game Is PSPACE-Complete. Search on Bibsonomy STACS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
25Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete. Search on Bibsonomy FUN The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
25Parosh Aziz Abdulla, Mohamed Faouzi Atig, Rojin Rezvan Parameterized verification under TSO is PSPACE-complete. Search on Bibsonomy Proc. ACM Program. Lang. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Md Lutfar Rahman, Thomas Watson 0001 6-Uniform Maker-Breaker Game Is PSPACE-Complete. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2020 DBLP  BibTeX  RDF
25Alec Henderson, Radu Nicolescu, Michael J. Dinneen Solving a PSPACE-complete problem with cP systems. Search on Bibsonomy J. Membr. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Josh Brunner, Lily Chung, Erik D. Demaine, Dylan H. Hendrickson, Adam Hesterberg, Adam Suhl, Avi Zeff 1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
25William Vega-Brown, Nicholas Roy Task and Motion Planning Is PSPACE-Complete. Search on Bibsonomy AAAI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Dmitry Chistikov 0001, Grzegorz Lisowski, Mike Paterson, Paolo Turrini Convergence of Opinion Diffusion is PSPACE-Complete. Search on Bibsonomy AAAI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Jan Philipp Wächter, Armin Weiß An Automaton Group with PSPACE-Complete Word Problem. Search on Bibsonomy STACS The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25David Caballero, Angel A. Cantu, Timothy Gomez, Austin Luchsinger, Robert T. Schweller, Tim Wylie Relocating Units in Robot Swarms with Uniform Control Signals is PSPACE-Complete. Search on Bibsonomy CCCG The full citation details ... 2020 DBLP  BibTeX  RDF
25Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems. Search on Bibsonomy CCC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
25Viliam Geffert Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
25Laurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß Groups with ALOGTIME-hard word problems and PSPACE-complete compressed word problems. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
25Jan Philipp Wächter, Armin Weiß An Automaton Group with PSPACE-Complete Word Problem. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
25Dmitry Chistikov 0001, Grzegorz Lisowski, Mike Paterson, Paolo Turrini Convergence of Opinion Diffusion is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
25Kyle Burke, Robert A. Hearn PSPACE-complete two-color planar placement games. Search on Bibsonomy Int. J. Game Theory The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
25Martin Böhm 0001, Pavel Veselý 0001 Online Chromatic Number is PSPACE-Complete. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke Universal Safety for Timed Petri Nets is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
25Jonathan Gabor, Aaron Williams Switches are PSPACE-Complete. Search on Bibsonomy CCCG The full citation details ... 2018 DBLP  BibTeX  RDF
25Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke Universal Safety for Timed Petri Nets is PSPACE-complete. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Tomás Masopust, Markus Krötzsch Deciding Universality of ptNFAs is PSpace-Complete. Search on Bibsonomy SOFSEM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
25Kuize Zhang The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete. Search on Bibsonomy Autom. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
25Weihua He, Ziwen Liu, Chao Yang 0003 Snowman is PSPACE-complete. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
25Viliam Geffert Unary Coded PSPACE-Complete Languages in ASPACE(loglog n). Search on Bibsonomy CSR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
25Reino Niskanen Reachability Problem for Polynomial Iteration Is PSPACE-complete. Search on Bibsonomy RP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
25Bernd Meyer 0008 Generalized Pete's Pike is PSPACE-complete. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
25André Grahl Pereira, Marcus Ritt, Luciana S. Buriol Pull and PushPull are PSPACE-complete. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
25Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich 0001 DAG-width is PSPACE-complete. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
25Markus Steindl On semigroups with PSPACE-complete subpower membership problem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
25Kyle Burke, Bob Hearn PSPACE-Complete Two-Color Placement Games. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
25Willem Heijltjes, Robin Houston 0001 Proof equivalence in MLL is PSPACE-complete. Search on Bibsonomy Log. Methods Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
25Martin Böhm 0001, Pavel Veselý 0001 Online Chromatic Number is PSPACE-Complete. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
25Massimo Cairo, Romeo Rizzi Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 379 (100 per page; Change: )
Pages: [1][2][3][4][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license