A Term Equality Problem Equivalent to Graph Isomorphism

Basin, David A.

doi:10.1016/0020-0190(94)00084-0

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Term Equality Problem Equivalent to Graph Isomorphism

MPS-Authors

/persons/resource/persons44075

Basin, David A.
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Basin, D. A. (1994). A Term Equality Problem Equivalent to Graph Isomorphism. Information Processing Letters, 51(2), 61-66. doi:10.1016/0020-0190(94)00084-0.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AD5D-B

Abstract

We demonstrate that deciding if two terms containing otherwise uninterpreted associative, commutative, and 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.