Complexity of Propositional Proofs Under a Promise. / Dershowitz, Nachum; Tzameret, Iddo.

In: ACM Transactions on Computational Logic, Vol. 11, No. 3, 2010, p. 1-30.

Research output: Contribution to journalArticlepeer-review



Original languageEnglish
Pages (from-to)1-30
Number of pages30
JournalACM Transactions on Computational Logic
Issue number3
Publication statusPublished - 2010
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 23655429