{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:40:23Z","timestamp":1787506823765,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319662626","type":"print"},{"value":"9783319662633","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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-319-66263-3_4","type":"book-chapter","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T04:05:11Z","timestamp":1502165111000},"page":"53-61","source":"Crossref","is-referenced-by-count":4,"title":["Hard Satisfiable Formulas for Splittings by Linear Combinations"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Itsykson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Knop","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,9]]},"reference":[{"issue":"1\u20133","key":"4_CR1","first-page":"51","volume":"35","author":"M Alekhnovich","year":"2005","unstructured":"Alekhnovich, M., Hirsch, E.A., Itsykson, D.: Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Autom. Reason. 35(1\u20133), 51\u201372 (2005)","journal-title":"J. Autom. Reason."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E.: Hard examples for bounded depth frege. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 563\u2013572. ACM (2002)","DOI":"10.1145\/509984.509988"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1613\/jair.1410","volume":"22","author":"P Beame","year":"2004","unstructured":"Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. (JAIR) 22, 319\u2013351 (2004)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"3","key":"4_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(96)83747-X","volume":"80","author":"P Beame","year":"1996","unstructured":"Beame, P., Pitassi, T.: An exponential separation between the parity principle and the pigeonhole principle. Ann. Pure Appl. Logic 80(3), 195\u2013228 (1996)","journal-title":"Ann. Pure Appl. Logic"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-642-00457-5_31","volume-title":"Theory of Cryptography","author":"J Cook","year":"2009","unstructured":"Cook, J., Etesami, O., Miller, R., Trevisan, L.: Goldreich\u2019s one-way function candidate and myopic backtracking algorithms. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 521\u2013538. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00457-5_31"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Dantchev, S.S., Riis, S.: Tree resolution proofs of the weak pigeon-hole principle. In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, pp. 69\u201375. IEEE Computer Society, 18\u201321 June 2001","DOI":"10.1109\/CCC.2001.933873"},{"issue":"7","key":"4_CR7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"4_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Garl\u00edk, M., Ko\u0142odziejczyk, L.A.: Some subsystems of constant-depth Frege with parity (2017, Preprint)","DOI":"10.1145\/3243126"},{"issue":"2","key":"4_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00224-013-9514-8","volume":"54","author":"D Itsykson","year":"2014","unstructured":"Itsykson, D.: Lower bound on average-case complexity of inversion of Goldreich\u2019s function by drunken backtracking algorithms. Theor. Comput. Syst. 54(2), 261\u2013276 (2014)","journal-title":"Theor. Comput. Syst."},{"issue":"1","key":"4_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10958-012-1105-8","volume":"188","author":"D Itsykson","year":"2013","unstructured":"Itsykson, D., Sokolov, D.: The complexity of inverting explicit Goldreich\u2019s function by DPLL algorithms. J. Math. Sci. 188(1), 47\u201358 (2013)","journal-title":"J. Math. Sci."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-662-44465-8_32","volume-title":"Mathematical Foundations of Computer Science 2014","author":"D Itsykson","year":"2014","unstructured":"Itsykson, D., Sokolov, D.: Lower bounds for splittings by linear combinations. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 372\u2013383. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-44465-8_32"},{"key":"4_CR13","unstructured":"Kraji\u010dek, J.: Randomized feasible interpolation and monotone circuits with a local oracle. CoRR, abs\/1611.0 (2016)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-40970-2_6","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"V Oparin","year":"2016","unstructured":"Oparin, V.: Tight upper bound on splitting by linear combinations for pigeonhole principle. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 77\u201384. Springer, Cham (2016). doi: 10.1007\/978-3-319-40970-2_6"},{"key":"4_CR15","unstructured":"Pudl\u00e1k, P., Impagliazzo, R.: A lower bound for DLL algorithms for k-SAT (preliminary version). In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, pp. 128\u2013136, 9\u201311 January 2000"},{"key":"4_CR16","unstructured":"Pudl\u00e1k, P., Scheder, D., Talebanfard, N.: Tighter Hard Instances for PPSZ. CoRR, abs\/1611.0 (2016)"},{"issue":"1","key":"4_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jcss.2004.01.004","volume":"69","author":"AA Razborov","year":"2004","unstructured":"Razborov, A.A.: Resolution lower bounds for perfect matching principles. J. Comput. Syst. Sci. 69(1), 3\u201327 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Scheder, D., Tang, B., Chen, S., Talebanfard, N.: Exponential Lower Bounds for the PPSZ k-SAT Algorithm. In: Khanna, S. (ed.) Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, pp. 1253\u20131263. SIAM, 6\u20138 January 2013","DOI":"10.1137\/1.9781611973105.91"},{"issue":"1","key":"4_CR19","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. J. ACM 34(1), 209\u2013219 (1987)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66263-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T16:59:48Z","timestamp":1750784388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66263-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662626","9783319662633"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66263-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}