On the Resolution Complexity of Graph Non-isomorphism

DOI10.1007/978-3-642-39071-5_6zbMath1433.03139OpenAlexW90768366MaRDI QIDQ5326453

Jacobo Toran

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_6

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Complexity of proofs (03F20)

Related Items (4)

Limitations of Algebraic Approaches to Graph Isomorphism Testing ⋮ Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas ⋮ The configurable SAT solver challenge (CSSC) ⋮ Unnamed Item

This page was built for publication: On the Resolution Complexity of Graph Non-isomorphism