Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators is Isomorphism Complete
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
We demonstrate that deciding if two terms containing uninterpreted associative-commutative function symbols and commutative variable binding operators are equal is polynomially equivalent to determining if two graphs are isomorphic. The reductions we use provide insight into this result and suggest polynomial time special cases.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1989-06
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/TR89-1020
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report