A Tough Nut for Tree Resolution
DOI:
https://doi.org/10.7146/brics.v7i10.20137Resumé
One of the earliest proposed hard problems for theorem provers isa propositional version of the Mutilated Chessboard problem. It is well
known from recreational mathematics: Given a chessboard having two
diagonally opposite squares removed, prove that it cannot be covered with
dominoes. In Proof Complexity, we consider not ordinary, but 2n * 2n
mutilated chessboard. In the paper, we show a 2^Omega(n) lower bound for tree resolution.
Downloads
Publiceret
2000-01-10
Citation/Eksport
Dantchev, S., & Riis, S. (2000). A Tough Nut for Tree Resolution. BRICS Report Series, 7(10). https://doi.org/10.7146/brics.v7i10.20137
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).