David Eppstein, Zvi Galil, et al.
STOC 1993
Paper
Hierarchies of complete problems
Abstract
An attempt is made to present a framework for the diverse complete problems that have been found. A new concept-a Hierarchy of Complete Problems is defined. Several hierarchies in various domains such as graph theory, automata theory, theorem proving and games are established. © 1976 Springer-Verlag.
Related
Zvi Galil
Theoretical Computer Science
Amir Averbuch, Zvi Galil, et al.
Theoretical Computer Science
Conference paper
Fully dynamic planarity testing
Zvi Galil, Giuseppe F. Italiano, et al.
STOC 1992