Everything about List of PSPACE-complete problems

🧭 Start here: a 6-step reading path

1. Read the overview: List of PSPACE-complete problemsA 5-minute orientation
2. Go sideways: PSPACE-completeA closely related topic
3. Go sideways: EXPTIMEA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• PSPACE-complete In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input…
• EXPTIME In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that are solvable…
• Reconfiguration In discrete mathematics and theoretical computer science, reconfiguration problems are computational problems involving reachability or connectivity of…
• NEXPTIME In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non-determinis…
• True quantified Boolean formula In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean…
• Alternating finite automaton In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal…
• Games, Puzzles, and Computation Games, Puzzles, and Computation is a book on game complexity, written by Robert Hearn and Erik Demaine, and published in 2009 by A K Peters. It is revised…
• Nondeterministic constraint logic In theoretical computer science, nondeterministic constraint logic is a combinatorial system in which an orientation is given to the edges of a weighted…