A Term Equality Problem Equivalent to Graph Isomorphism

Basin, David A.

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

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

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.