{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:04:34Z","timestamp":1760299474967},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662540688"},{"type":"electronic","value":"9783662540695"}],"license":[{"start":{"date-parts":[[2016,12,3]],"date-time":"2016-12-03T00:00:00Z","timestamp":1480723200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54069-5_6","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T08:43:15Z","timestamp":1480668195000},"page":"64-76","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Finding Read-Once NAE-Resolution Refutations"],"prefix":"10.1007","author":[{"given":"Hans Kleine","family":"B\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"6_CR1","first-page":"66","volume":"65","author":"P Beame","year":"1998","unstructured":"Beame, P., Pitassi, T.: Propositional proof complexity: past, present, future. Bull. EATCS 65, 66\u201389 (1998)","journal-title":"Bull. EATCS"},{"key":"6_CR2","unstructured":"Buss, S.R.: Propositional proof complexity: an introduction. http:\/\/www.math.ucsd.edu\/~sbuss\/ResearchWeb\/marktoberdorf97\/paper.pdf"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Reckhow, R.A.: On the lengths of proofs in the propositional calculus (preliminary version). In: Proceedings of the 6th Annual ACM Symposium on Theory of Computing, Seattle, Washington, USA, 30 April \u2013 2 May 1974, pp. 135\u2013148 (1974)","DOI":"10.1145\/800119.803893"},{"key":"6_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511576430","volume-title":"Handbook of Practical Logic and Automated Reasoning","author":"J Harrison","year":"2009","unstructured":"Harrison, J.: Handbook of Practical Logic and Automated Reasoning, 1st edn. Cambridge University Press, Cambridge (2009)","edition":"1"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyano, E.: Intractability of read-once resolution. In: Proceedings of the 10th Annual Conference on Structure in Complexity Theory (SCTC 1995), CA, USA, pp. 29\u201336. IEEE Computer Society Press, Los Alamitos, June 1995","DOI":"10.1109\/SCT.1995.514725"},{"key":"6_CR6","unstructured":"Kleine B\u00fcning, H., Wojciechowski, P., Subramani, K.: On the computational complexity of read once resolution decidability in 2CNF formulas. https:\/\/arxiv.org\/abs\/1610.04523"},{"key":"6_CR7","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199233212.001.0001","volume-title":"The Nature of Computation","author":"C Moore","year":"2011","unstructured":"Moore, C., Mertens, S.: The Nature of Computation, 1st edn. Oxford University Press, Oxford (2011)","edition":"1"},{"key":"6_CR8","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)"},{"issue":"1","key":"6_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"6_CR10","first-page":"216","volume-title":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","author":"T Schaefer","year":"1978","unstructured":"Schaefer, T.: The complexity of satisfiability problems. In: Aho, A. (ed.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM Press, New York City (1978)"},{"issue":"4","key":"6_CR11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2178\/bsl\/1203350879","volume":"1","author":"A Urquhart","year":"1995","unstructured":"Urquhart, A.: The complexity of propositional proofs. Bull. Symbolic Logic 1(4), 425\u2013467 (1995)","journal-title":"Bull. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54069-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:06:50Z","timestamp":1498367210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54069-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,3]]},"ISBN":["9783662540688","9783662540695"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54069-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,3]]}}}