The Complexity of the Equivalence Problem for Simple Programs

Authors:
Eitan M. Gurari;Oscar H. Ibarra
Affiliations:
Department of Computer Science, SUNY at Buffalo, 4226 Ridge Lea Road, Amherst, New York;Department of Computer Science, University of Minnesota, 136 Lind Hall, Minneapolis, Minnesota
Venue:
Journal of the ACM (JACM)
Year:
1981

Citing 8
Cited 2

The Equivalence Problem of Simple Programs

Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure

Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The complexity of loop programs

ACM '67 Proceedings of the 1967 22nd national conference
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC

SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC

Decidable problems for powerful programs

Journal of the ACM (JACM)
Data processing and computer science theory

SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract