On the Computational Complexity of Scheme Equivalence
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Abstract
We consider the computational complexity of several decidable problems about program schemes and simple programming languages. In particular, we show that the equivalence problem for Ianov schemes is NP-complete, but that the equivalence problem for strongly free schemes, which approximate the class of Ianov schemes which would actually be written, can be solved in time quadratic in the size of the scheme. We also show that many other simple scheme classes or simple restricted programming languages have polynomially complete equivalence problems. Some are complete for the same reason that Ianov schemes are complete and some are complete for other reasons.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1974-03
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR74-201
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report