Arc Kayles is PSPACE-complete
Lax689614.Completeness · concepts/Lax689614/Completeness.lean · lax-689614
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Theorem 1. Determining the winner of Arc Kayles on a finite simple undirected graph is PSPACE-complete under polynomial-time many-one reductions. Membership follows by depth-first evaluation of the game tree: at most moves are played and each position uses bits. Hardness follows from the positive CNF game and the reduction graph.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax689614.Reduction |
| 2 | import Lax689614.PositiveCNFHardness |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Arc Kayles is PSPACE-complete |
| 7 | type: theorem |
| 8 | --- |
| 9 | Theorem 1. Determining the winner of Arc Kayles on a finite simple |
| 10 | undirected graph is PSPACE-complete under polynomial-time many-one |
| 11 | reductions. Membership follows by depth-first evaluation of the game tree: |
| 12 | at most moves are played and each position uses bits. |
| 13 | Hardness follows from the positive CNF game and the reduction graph. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax689614.Completeness |
| 17 | |
| 18 | axiom membership : Encoding.arcKayles ∈ Lax434930.PolynomialSpace.PSPACE |
| 19 | |
| 20 | axiom pspace_complete : PSPACE.Complete Encoding.arcKayles |
| 21 | |
| 22 | end Lax689614.Completeness |
| 23 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments