Abstract
Sharpening an argument in (Cook and Luby, 1988), we show that the problem of recognizing refutable propositional logic formulas in conjunctive normal form with two disjuncts is monotonic p-projection equivalent to the problem st-DCON of directed connectivity between two distinguished vertices s, t of a directed graph. It follows by (Karchmer and Wigderson, 1990) that the monotonic depth of bounded fan-in boolean circuits for 2- ref is Θ(log 2( n)).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
