Lax307052.PolynomialSpace
PSPACE equals NPSPACE
concepts/Lax307052/PolynomialSpace.lean · lax-307052
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
Deterministic and nondeterministic polynomial space define the same class of binary languages.
Lean source view on GitHub
| 1 | import Lax307052.Savitch |
| 2 | import Lax307052.PolyBounds |
| 3 | import Lax434930.PolynomialSpace |
| 4 | import Lax434930.NondeterministicPolynomialSpace |
| 5 | |
| 6 | /-! |
| 7 | --- |
| 8 | title: PSPACE equals NPSPACE |
| 9 | type: theorem |
| 10 | --- |
| 11 | Deterministic and nondeterministic polynomial space define the same class |
| 12 | of binary languages. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax307052.PolynomialSpace |
| 16 | |
| 17 | open Lax434930.PolynomialSpace Lax434930.NondeterministicPolynomialSpace |
| 18 | |
| 19 | axiom pspace_eq_npspace : PSPACE = NPSPACE |
| 20 | |
| 21 | end Lax307052.PolynomialSpace |
| 22 |
Builds on
Used by
none
From Mathlib
none
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments