{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:00:48Z","timestamp":1725552048608},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_26","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"274-282","source":"Crossref","is-referenced-by-count":0,"title":["A New Lower Bound of Critical Function for (k,s)-SAT"],"prefix":"10.1007","author":[{"given":"Ping","family":"Gong","sequence":"first","affiliation":[]},{"given":"Daoyun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discr. Appl. Math.\u00a08(1), 85\u201389 (1984)","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0166-218X(90)90020-D","volume":"26","author":"O. Dubois","year":"1990","unstructured":"Dubois, O.: On the r, s-SAT satisfiability problem and a conjecture of Tovey. Discr. Appl. Math.\u00a026(1), 50\u201360 (1990)","journal-title":"Discr. Appl. Math."},{"key":"26_CR3","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Electronic Colloquium on Computational Complexity(ECCC). Technical Report TR03-022 (2003)"},{"key":"26_CR4","unstructured":"Hoory, S., Szeider, S.: Computing unsatisfiable k-SAT instances with few occurrences per variable (2004) (submitted)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01209713","volume":"30","author":"J. Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl, J., Savick\u00fd, P., tuza, Z.: One more occurrence of variables make satisfiability jmup from trivial to NP-complete. Acta Informatica\u00a030, 397\u2013403 (1993)","journal-title":"Acta Informatica"},{"issue":"1-2","key":"26_CR6","first-page":"49","volume":"238","author":"P. Savick\u00fd","year":"2000","unstructured":"Savick\u00fd, P., Sgall, J.: DNF tautologies with a limited number of occurrences of every vairiable. Theoret. Comput. Sci.\u00a0238(1-2), 49\u2013495 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR7","series-title":"Wiley-Interscience Series","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series. John Wiley & Sons. Inc, NewYork (1992)"},{"key":"26_CR8","volume-title":"Ten Lectures on the Probabilistic Method","author":"J.H. Spencer","year":"1987","unstructured":"Spencer, J.H.: Ten Lectures on the Probabilistic Method. SIAM, Philadephia (1987); Second edition published in (1994)"},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1017\/S0963548300000730","volume":"2","author":"C. Mcdiarmid","year":"1973","unstructured":"Mcdiarmid, C.: A random recolouring method for graphs and hypergraphs. Combinatorics, Probability and Computing\u00a02, 363\u2013365 (1973)","journal-title":"Combinatorics, Probability and Computing"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/S0012-365X(96)00249-X","volume":"167\/168","author":"C. Mcdiarmid","year":"1997","unstructured":"Mcdiarmid, C.: Hypergraph colouring and the Lov\u00e1sz Local Lemmma. Discrete Mathematics\u00a0167\/168, 481\u2013486 (1997)","journal-title":"Discrete Mathematics"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0012-365X(78)90191-7","volume":"24","author":"J. Beck","year":"1978","unstructured":"Beck, J.: On 3-chomatic hypergraphs. Discrete Mathematics\u00a024, 127\u2013137 (1978)","journal-title":"Discrete Mathematics"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1002\/(SICI)1098-2418(200001)16:1<4::AID-RSA2>3.0.CO;2-2","volume":"16","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Srinivasan, A.: Improved bounds and algorithms for hypergraph 2-colouring. Rand. Structures and Algorithms\u00a016, 4\u201332 (2000)","journal-title":"Rand. Structures and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:29Z","timestamp":1619506589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11750321_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}