A term equality problem equivalent to graph isomorphism
type: Item
instance of: scholarly article
title: A term equality problem equivalent to graph isomorphism
zbMATH Open document ID: 0813.68149
DOI: 10.1016/0020-0190(94)00084-0
author: David Basin
published in: Information Processing Letters
publication date: 1994-09-05T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 633515
zbMATH Keywords: automatic theorem proving
zbMATH Keywords: computational complexity
zbMATH Keywords: equality reasoning
zbMATH Keywords: graph isomorphism
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00084-0
OpenAlex ID: W2044251157
cites work: Q4091421
cites work: Q3696500
cites work: Q3696522
cites work: Q4124865
cites work: Q3743300
cites work: Q4198056
cites work: Q4148000
cites work: The NP-completeness column: An ongoing guide
cites work: Q3785940
Recommended article: Q3722543
Recommended article: Q3312272
Recommended article: Graph isomorphism problem
Recommended article: Graph isomorphism and equality of simplices
Recommended article: Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism''
Recommended article: Q5557107
Recommended article: Q4239589
Recommended article: Equality of graphs up to complementation
Recommended article: Q4710599
Recommended article: Graph algebras and the graph isomorphism problem
description: scientific article; zbMATH DE number 633515