Review/Citation: Dershowitz, N., Tzameret, Iddo. Complexity of Propositional Proofs Under a Promise. ACM Transactions on Computational Logic. 2010, 11(3), 1-29. ISSN 1529-3785
Requested document: Tzameret1.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.