The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1994-2004 (15) 2005-2010 (18) 2012-2020 (15) 2021-2023 (5)
Publication types (Num. hits)
article(18) inproceedings(35)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 28 occurrences of 22 keywords

Results
Found 53 publication records. Showing 53 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
57Wolfgang Slany The Complexity of Graph Ramsey Games. Search on Bibsonomy Computers and Games The full citation details ... 2000 DBLP  DOI  BibTeX  RDF combinatorial games, graph Ramsey theory, Ramsey game, winning strategy, achievement game, avoidance game, the game of Sim, endgames, complexity, Java applet, edge coloring, PSPACE-completeness
45Paul Hunter, Anuj Dawar Complexity Bounds for Regular Games. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
44Alexander Hertel, Alasdair Urquhart Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. Search on Bibsonomy CSL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Parikshit 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
34Petr Jancar Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. Search on Bibsonomy LICS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides The complexity of (un)folding. Search on Bibsonomy SCG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF linkage reconfiguration, computational geometry, PSPACE-completeness
33Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram The size-change principle for program termination. Search on Bibsonomy POPL The full citation details ... 2001 DBLP  DOI  BibTeX  RDF omega automaton, program analysis, termination, partial evaluation, PSPACE-completeness
30Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera 0001 Stochastic Game Logic. Search on Bibsonomy QEST The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala Pspace-completeness of the temporal logic of sub-intervals and suffixes. Search on Bibsonomy Inf. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
29Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch PSPACE-Completeness of Reversible Deterministic Systems. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
29Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch PSPACE-Completeness of Reversible Deterministic Systems. Search on Bibsonomy MCU The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
29Joshua Ani, Lily Chung, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude. Search on Bibsonomy FUN The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
29Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes. Search on Bibsonomy TIME The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
29Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl PSPACE-completeness of Pulling Blocks to Reach a Goal. Search on Bibsonomy J. Inf. Process. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
29Eurinardo Rodrigues Costa, Victor Lage Pessoa, Rudini M. Sampaio, Ronan Soares PSPACE-completeness of two graph coloring games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
29Joshua Ani, Sualeh Asif, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch, Sarah Scheffler, Adam Suhl PSPACE-completeness of Pulling Blocks to Reach a Goal. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
29Guanjun Liu PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets. Search on Bibsonomy Petri Nets The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
29Rémi Nollet, Alexis Saurin, Christine Tasson PSPACE-Completeness of a Thread Criterion for Circular Proofs in Linear Logic with Least and Greatest Fixed Points. Search on Bibsonomy TABLEAUX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
29Davide Tateo, Jacopo Banfi, Alessandro Riva, Francesco Amigoni, Andrea Bonarini Multiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It. Search on Bibsonomy AAAI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
29Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Mirko Rossi On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. Search on Bibsonomy FUN The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
29Eric Goles 0001, Pedro Montealegre 0001, Ville Salo, Ilkka Törmä PSPACE-completeness of majority automata networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
29Eric Goles Ch., Pedro Montealegre 0001, Ville Salo, Ilkka Törmä PSPACE-Completeness of Majority Automata Networks. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
29Edouard Bonnet, Florian Jamain, Abdallah Saffidine Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. Search on Bibsonomy ACG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
29Maria I. Andreou, Dimitris Fotakis 0001, Vicky Papadopoulou Lesta, Sotiris E. Nikoletseas, Paul G. Spirakis On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations. Search on Bibsonomy Algorithms, Probability, Networks, and Games The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
29Tom C. van der Zanden, Hans L. Bodlaender PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. Search on Bibsonomy CIAC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
29Tom C. van der Zanden, Hans L. Bodlaender PSPACE-completeness of Bloxorz and of Games with 2-Buttons. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
29John M. Hitchcock, Aduri Pavan Length-Increasing Reductions for PSPACE-Completeness. Search on Bibsonomy MFCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
29Daniel Kirsten Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
29Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata Stonehenge: Outcome of All First Moves and PSPACE-Completeness. Search on Bibsonomy J. Int. Comput. Games Assoc. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
29Philipp Hertel, Toniann Pitassi The PSPACE-Completeness of Black-White Pebbling. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
29Paul S. Bonsma, Luis Cereceda Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
29Yasuhiko Takenaga, Shigeru Arai PSPACE-completeness of an escape problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
29Philipp Hertel, Toniann Pitassi Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Paul 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
29Dimitris 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 J. Discrete Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
29Kurt 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
29Robert 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 Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Robert 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 CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
29Maria 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 MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Dimitris 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 WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
29Jean-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
24Akitoshi Kawamura, Stephen A. Cook Complexity theory for operators in analysis. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF higher-type complexity, second-order polynomials, computational complexity, computable analysis
24Ke 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
24Michael J. Wooldridge, Paul E. Dunne Optimistic and Disjunctive Agent Design Problems. Search on Bibsonomy ATAL The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
20José L. Balcázar The Complexity of Searching Succinctly Represented Graphs. Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
15Michael Schmidt 0002, Michael Meier 0002, Georg Lausen Foundations of SPARQL query optimization. Search on Bibsonomy ICDT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF SPARQL algebra, complexity, query optimization, RDF, SPARQL, semantic query optimization
15Julien Cristau, Florian Horn 0001 On Reachability Games of Ordinal Length. Search on Bibsonomy SOFSEM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
15Marco Cadoli, Thomas Eiter, Georg Gottlob Complexity of propositional nested circumscription and nested abnormality theories. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Horn theories, nested abnormality theories, computational complexity, nonmonotonic reasoning, knowledge representation and reasoning, Circumscription
15Jirí Srba Timed-Arc Petri Nets vs. Networks of Timed Automata. Search on Bibsonomy ICATPN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
15Bernhard Schwarz The Complexity of Satisfiability Problems over Finite Lattices. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
15Thomas Brihaye, Véronique Bruyère, Jean-François Raskin Model-Checking for Weighted Timed Automata. Search on Bibsonomy FORMATS/FTRTFT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
15Uwe Egly Embedding Lax Logic into Intuitionistic Logic. Search on Bibsonomy CADE The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
15Volker Diekert, Anca Muscholl Solvability of Equations in Free Partially Commutative Groups Is Decidable. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #53 of 53 (100 per page; Change: )
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