{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T07:50:35Z","timestamp":1717141835153},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s00493-012-2679-y","type":"journal-article","created":{"date-parts":[[2012,10,4]],"date-time":"2012-10-04T03:03:54Z","timestamp":1349319834000},"page":"573-587","source":"Crossref","is-referenced-by-count":6,"title":["Disproof of the neighborhood conjecture with implications to SAT"],"prefix":"10.1007","volume":"32","author":[{"given":"Heidi","family":"Gebauer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,4]]},"reference":[{"key":"2679_CR1","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0097-3165(86)90060-9","volume":"43","author":"R. Aharoni","year":"1986","unstructured":"R. Aharoni and N. Linial: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, J. Combin. Theory Ser. A 43, (1986), 196\u2013204.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2679_CR2","unstructured":"N. Alon and J. H. Spencer: The Probabilistic Method, J. John Wiley & Sons (2002)."},{"key":"2679_CR3","doi-asserted-by":"crossref","unstructured":"J. Beck: Combinatorial Games: Tic Tac Toe Theory, Encyclopedia of Mathematics and its Applications 114, 2008.","DOI":"10.1017\/CBO9780511735202"},{"key":"2679_CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01897304","volume":"40","author":"J. Beck","year":"1982","unstructured":"J. Beck: Remarks on positional games, Acta Math. Acad. Sci. Hungar. 40, (1982), 65\u201371.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2679_CR5","first-page":"229","volume":"23","author":"G. Davydov","year":"1998","unstructured":"G. Davydov, I. Davydova and H. Kleine B\u00fcning: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF, Artif. Intell. 23, (1998), 229\u2013245.","journal-title":"Artif. Intell."},{"key":"2679_CR6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","volume":"14","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s and J. L. Selfridge: On a combinatorial game, J. Combinatorial Theory Ser. A 14, (1973), 298\u2013301.","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"2679_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90040-4","volume":"30","author":"P. Erd\u0151s","year":"1991","unstructured":"P. Erd\u0151s and J. Spencer: Lopsided Lov\u00e1sz local lemma and Latin transversals, Discrete Appl. Math. 30, (1991), 151\u2013154.","journal-title":"Discrete Appl. Math."},{"key":"2679_CR8","doi-asserted-by":"crossref","unstructured":"H. Gebauer, T. Szab\u00f3 and G. Tardos: The Local Lemma is Tight for SAT, Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (2011), 664\u2013674.","DOI":"10.1137\/1.9781611973082.52"},{"issue":"2","key":"2679_CR9","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1137\/S0895480104445745","volume":"20","author":"S. Hoory","year":"2006","unstructured":"S. Hoory and S. Szeider: A note on unsatisfiable k-CNF formulas with few occurrences per variable, SIAM J. Discrete Math 20(2), (2006), 523\u2013528.","journal-title":"SIAM J. Discrete Math"},{"issue":"1\u20133","key":"2679_CR10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.tcs.2005.02.004","volume":"337","author":"S. Hoory","year":"2005","unstructured":"S. Hoory and S. Szeider: Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable, Theoretical Computer Science 337(1\u20133), (2005), 347\u2013359.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2679_CR11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0166-218X(02)00405-5","volume":"130","author":"H. Kleine B\u00fcning","year":"2003","unstructured":"H. Kleine B\u00fcning and X. Zhao: On the structure of some classes of minimal unsatisfiable formulas, Discr. Appl. Math. 130(2), (2003), 185\u2013207.","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"2679_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0222015","volume":"22","author":"J. Kratochv\u00edl","year":"1993","unstructured":"J. Kratochv\u00edl, P. Savick\u00fd and Z. Tuza: One more occurrence of variables makes satisfiability jump from trivial to NP-complete, SIAM J. Comput. 22(1), (1993), 203\u2013210.","journal-title":"SIAM J. Comput."},{"key":"2679_CR13","doi-asserted-by":"crossref","unstructured":"O. Kullmann: An application of matroid theory to the SAT problem, Fifteenth Annual IEEE Conference on Computational Complexity, (2000), 116\u2013124.","DOI":"10.1109\/CCC.2000.856741"},{"key":"2679_CR14","doi-asserted-by":"crossref","unstructured":"R. Moser: A constructive proof of the Lov\u00e1sz Local Lemma, Proc. 41st Annual ACM Symposium on Theory of Computing (STOC), (2009), 343\u2013350.","DOI":"10.1145\/1536414.1536462"},{"issue":"1\u20132","key":"2679_CR15","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S0304-3975(00)00036-0","volume":"238","author":"P. Savick\u00fd","year":"2000","unstructured":"P. Savick\u00fd and J. Sgall: DNF tautologies with a limited number of occurrences of every variable, Theoret. Comput. Sci. 238(1\u20132), (2000), 495\u2013498.","journal-title":"Theoret. Comput. Sci."},{"key":"2679_CR16","unstructured":"D. Scheder: Unsatisfiable Linear CNF Formulas Are Large and Complex, 27th International Symposium on Theoretical Aspects of Computer Science (STACS), (2010), 621\u2013631."},{"issue":"2","key":"2679_CR17","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0166-218X(02)00411-0","volume":"130","author":"S. Szeider","year":"2003","unstructured":"S. Szeider: Homomorphisms of conjunctive normal forms, Discr. Appl. Math. 130(2), (2003), 351\u2013365.","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"2679_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C. A. Tovey","year":"1984","unstructured":"C. A. Tovey: A simplified NP-complete satisfiability problem, Discr. Appl. Math. 8(1), (1984), 85\u201389.","journal-title":"Discr. Appl. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2679-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2679-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2679-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T11:37:52Z","timestamp":1562240272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2679-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["2679"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2679-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}