Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits

Matti Järvisalo, Tommi Junttila, Ilkka Niemelä

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Original languageEnglish
    Title of host publicationEighth International Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, Florida, USA, 4.-6.1.2004
    Publication statusPublished - 2004
    MoE publication typeA4 Article in a conference publication

    Keywords

    • Boolean circuits
    • proof complexity
    • satisfiability
    • tableau method

    Cite this