A term equality problem equivalent to graph isomorphism
From MaRDI portal
Recommendations
- Publication:3722543
- Publication:3312272
- Graph isomorphism problem
- Graph isomorphism and equality of simplices
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism
- Publication:5557107
- Publication:4239589
- Equality of graphs up to complementation
- Publication:4710599
- Graph algebras and the graph isomorphism problem
Cites work
- scientific article; zbMATH DE number 3921960 (Why is no real title available?)
- scientific article; zbMATH DE number 3921983 (Why is no real title available?)
- scientific article; zbMATH DE number 3976991 (Why is no real title available?)
- scientific article; zbMATH DE number 4049047 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3550750 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- The NP-completeness column: An ongoing guide
Cited in
(5)- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- Graph isomorphism and equality of simplices
- scientific article; zbMATH DE number 4164133 (Why is no real title available?)
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism
- On the isomorphism of expressions
This page was built for publication: A term equality problem equivalent to graph isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332775)