{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:49Z","timestamp":1725490429751},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_27","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"291-302","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Propositional Proofs Under a Promise"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[]},{"given":"Iddo","family":"Tzameret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1137\/S0097539700369156","volume":"31","author":"P. Beame","year":"2002","unstructured":"Beame, P., Karp, R., Pitassi, T., Saks, M.: The efficiency of resolution and Davis-Putnam procedures. SIAM J. Comput.\u00a031(4), 1048\u20131075 (2002)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E. Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow\u2014resolution made simple. J. ACM\u00a048(2), 149\u2013169 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S.A. Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic\u00a044(1), 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"key":"27_CR4","unstructured":"Dershowitz, N., Tzameret, I.: Complexity of propositional proofs under a promise (full version) (2007), \n                    \n                      http:\/\/www.cs.tau.ac.il\/~tzameret\/PromiseProofs.pdf"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Feige, U., Kim, J., Ofek, E.: Witnesses for non-satisfiability of dense random 3CNF formulas. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 497\u2013508 (October 2006)","DOI":"10.1109\/FOCS.2006.78"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1093\/jigpal\/6.1.59","volume":"6","author":"E. Hirsch","year":"1998","unstructured":"Hirsch, E.: A fast deterministic algorithm for formulas that have many satisfying assignments. Logic Journal of the IGPL\u00a06(1), 59\u201371 (1998)","journal-title":"Logic Journal of the IGPL"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/978-3-540-27821-4_37","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"L. Trevisan","year":"2004","unstructured":"Trevisan, L.: A note on approximate counting for k-DNF. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 417\u2013426. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:03Z","timestamp":1619518263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}