College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||The Complexity of Equivalence and Containment for Free Single Variable Program Schemes|
|Authors: ||Fortune, Steven|
Hopcroft, John E.
Schmidt, Erik Meineche
|Keywords: ||computer science|
|Issue Date: ||May-1977|
|Publisher: ||Cornell University|
|Abstract: ||Non-containment for free single variable program schemes is shown to be NP-complete. A polynomial time algorithm for deciding equivalence of two free schemes, provided one of them has the predicates appearing in the same order in all executions, is given. However, the ordering of a free scheme is shown to lead to an exponential increase in size.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.