A term equality problem equivalent to graph isomorphism
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3952822
- scientific article; zbMATH DE number 3841910
- Graph isomorphism problem
- Graph isomorphism and equality of simplices
- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism
- scientific article; zbMATH DE number 3272309
- scientific article; zbMATH DE number 1279034
- Equality of graphs up to complementation
- scientific article; zbMATH DE number 3815
- Graph algebras and the graph isomorphism problem
Cites work
- [article; zbMATH DE number 3921960 (Why is no real title available?)]
- [article; zbMATH DE number 3921983 (Why is no real title available?)]
- [article; zbMATH DE number 3976991 (Why is no real title available?)]
- [article; zbMATH DE number 4049047 (Why is no real title available?)]
- [article; zbMATH DE number 3511563 (Why is no real title available?)]
- [article; zbMATH DE number 3550750 (Why is no real title available?)]
- [article; zbMATH DE number 3575612 (Why is no real title available?)]
- [article; zbMATH DE number 3639144 (Why is no real title available?)]
- The NP-completeness column: An ongoing guide
Cited in
(5)- Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism
- On the isomorphism of expressions
- Graph isomorphism and equality of simplices
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- scientific article; zbMATH DE number 4164133 (Why is no real title available?)
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)