Acta Informatica

Paper

01 Mar 1976

Hierarchies of complete problems

View publication

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.

Conference paper

Separator based sparsification for dynamic planar graph algorithms

David Eppstein, Zvi Galil, et al.

STOC 1993

Paper

Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial, part I: The algebra G[u] <Q(u)^l>, l>1

Amir Averbuch, Zvi Galil, et al.

Theoretical Computer Science

Paper

Two fast simulations which imply some fast string matching and palindrome-recognition algorithms

Zvi Galil

Information Processing Letters

Conference paper

Witnesses for Boolean matrix multiplication and for shortest paths

Noga Alon, Zvi Galil, et al.

FOCS 1992

View all publications