The Complexity of the Equivalence Problem for Straight-Line Programs


We look at several classes of straight-line programs and show that the equivalence problem is either undecidable or computationally intractable for all but the trivial classes. For example, there is no algorithm to determine if an arbitrary program (with positive, negative, or zero integer inputs) using only constructs x ← 1, x ← x + y, x ← x/y (integer… (More)
DOI: 10.1145/800141.804675


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics