Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators is Isomorphism Complete
| dc.contributor.author | Basin, David A. | en_US |
| dc.date.accessioned | 2007-04-23T17:37:20Z | |
| dc.date.available | 2007-04-23T17:37:20Z | |
| dc.date.issued | 1989-06 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 967735 bytes | |
| dc.format.extent | 223745 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1020 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6820 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators is Isomorphism Complete | en_US |
| dc.type | technical report | en_US |