Complexity of Propositional Proofs Under a Promise

Nachum Dershowitz, Iddo Tzameret

Research output: Contribution to journal › Article › peer-review

65 Downloads (Pure)

Original language	English
Pages (from-to)	1-30
Number of pages	30
Journal	ACM Transactions on Computational Logic
Volume	11
Issue number	3
Publication status	Published - 2010

Access to Document

@article{b46fb1b539f74ec88de246e9c5b30509,

title = "Complexity of Propositional Proofs Under a Promise",

author = "Nachum Dershowitz and Iddo Tzameret",

year = "2010",

language = "English",

volume = "11",

pages = "1--30",

journal = "ACM Transactions on Computational Logic",

issn = "1529-3785",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}