A term equality problem equivalent to graph isomorphism

DOI10.1016/0020-0190(94)00084-0zbMath0813.68149OpenAlexW2044251157MaRDI QIDQ1332775

David A. Basin

Publication date: 5 September 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00084-0

zbMATH Keywords

computational complexitygraph isomorphismautomatic theorem provingequality reasoning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ On the isomorphism of expressions

Cites Work

• The NP-completeness column: An ongoing guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A term equality problem equivalent to graph isomorphism