T
Thomas J. Schaefer
Researcher at University of California, Berkeley
Publications - 3
Citations - 2463
Thomas J. Schaefer is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Decidability & PSPACE. The author has an hindex of 3, co-authored 3 publications receiving 2295 citations.
Papers
More filters
Proceedings ArticleDOI
The complexity of satisfiability problems
TL;DR: An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
Journal ArticleDOI
The complexity of some two-person perfect-information games.
TL;DR: A number of two-person games, based on simple combinatorial ideas, for which the problem of deciding whether the first player can win is complete in polynomial space provides strong evidence, although not absolute proof, that efficient general algorithms for deciding the winner of these games do not exist.
Proceedings ArticleDOI
Complexity of decision problems based on finite two-person perfect-information games
TL;DR: A number of simply-structured combinatorial games are presented for which the problem of determining the outcome of optimal play is complete in polynomial space—a condition which gives very strong assurance that these problems are hard.