Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
PSPACE-complete
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Type of decision problem in computer science}} 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 length ([[PSPACE|polynomial space]]) and if every other problem that can be solved in polynomial space can be [[Polynomial-time reduction|transformed to it in polynomial time]]. The problems that are PSPACE-complete can be thought of as the hardest problems in [[PSPACE]], the class of decision problems solvable in polynomial space, because a solution to any one such problem could easily be used to solve any other problem in PSPACE. Problems known to be PSPACE-complete include determining properties of [[regular expression]]s and [[context-sensitive grammar]]s, determining the truth of [[quantified Boolean formula problem|quantified Boolean formulas]], step-by-step changes between solutions of combinatorial optimization problems, and many puzzles and games.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)