Number of the records: 1
Complexity of Propositional Proofs Under a Promise
- 1.Dershowitz, N. - Tzameret, Iddo
Complexity of Propositional Proofs Under a Promise.
ACM Transactions on Computational Logic. Roč. 11, č. 3 (2010), s. 1-29. ISSN 1529-3785. E-ISSN 1557-945X
Impact factor: 1.391, year: 2010
http://dl.acm.org/citation.cfm?doid=1740582.1740586
http://hdl.handle.net/11104/0186297
Number of the records: 1