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. 2010, 11(3), 1-29. ISSN 1529-3785. E-ISSN 1557-945X. Available: doi: 10.1145/1740582.1740586.
Number of the records: 1