Playing disjunctive sums is polynomial space complete
β Scribed by F. L. Morris
- Book ID
- 105300636
- Publisher
- Springer-Verlag
- Year
- 1981
- Tongue
- English
- Weight
- 607 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0020-7276
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
It is shown that the infiniteness problem of proof (a) is polynomial-space complete. The set proof (~) is the set of closed I-terms in p-normal form which has a as their types. The set is identical to the set of normal form proofs of a in the natural deduction system for implicational fragment of in
This paper considers a generalization, called the Shannon switching game on vertices, of a familiar board game called Hex. It is shown that determining who wins such a game if each player plays perfectly is very hard; in fact, if this game problem is solvable in polynomial time, then any problem sol