The NP-completeness column: An ongoing guide
- 31 December 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (4) , 397-411
- https://doi.org/10.1016/0196-6774(83)90019-6
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The complexity of two-player games of incomplete informationJournal of Computer and System Sciences, 1984
- The complexity of completing partial Latin squaresDiscrete Applied Mathematics, 1984
- Embedding partial steiner triple systems is NP-completeJournal of Combinatorial Theory, Series A, 1983
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- AlternationJournal of the ACM, 1981
- The complexity of problems in systems of communicating sequential processesJournal of Computer and System Sciences, 1980
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, 1980
- Gobang ist PSPACE-vollständigActa Informatica, 1980
- Classes of Pebble Games and Complete ProblemsSIAM Journal on Computing, 1979
- Storage requirements for deterministic polynomialtime recognizable languagesJournal of Computer and System Sciences, 1976