Abstract
A class of propositional formulas, encoding the property that every finite, transitive digraph with no two-cycles must have a source, has been investigated by Krishnamurty and conjectured as hard for resolution. In this note we prove, opposed to that conjecture, that there are proofs of polynomial lengths (or even linear in the lengths of the formulas) of those formulas.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.