{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T04:10:13Z","timestamp":1739851813654,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_56","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T17:00:37Z","timestamp":1265734837000},"page":"502-508","source":"Crossref","is-referenced-by-count":1,"title":["Random Instance Generation for MAX 3SAT"],"prefix":"10.1007","author":[{"given":"Mitsuo","family":"Motoki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"key":"56_CR1","unstructured":"D. Achlioptas, C. Gomes, H. Kautz, and B. Selman Generating satisfiable problem instances. Proc. of AAAI-2000\/IAAI-2000, 2000."},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Y. Asahiro, K. Iwama, and E. Miyano Random generation of test instances with controlled attributes. Johnson and Trick, eds., Cliques, Coloring, and Satisfiability, DIMACS vol. 26, pp. 377\u2013393. AMS, 1996.","DOI":"10.1090\/dimacs\/026\/18"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M.X. Goemans","year":"1994","unstructured":"M.X. Goemans and D.P. Williamson New 3\/4-approximation algorithms for the maximum satisfiability problem. SIAM J. Discrete Math., 7:656\u2013666, 1994.","journal-title":"SIAM J. Discrete Math"},{"issue":"6","key":"56_CR4","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"M.X. Goemans and D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115\u20131145, 1995.","journal-title":"J. ACM"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad Some optimal inapproximability results. Proc. of STOC\u201997, pp. 1\u201310, 1997.","DOI":"10.1145\/258533.258536"},{"key":"56_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-63890-3_4","volume-title":"Proc. of ISAAC\u201997","author":"S. Horie","year":"1997","unstructured":"S. Horie and O. Watanabe Hard instance generation for SAT (extended abstract). Proc. of ISAAC\u201997, LNCS 1350, pp. 22\u201331, 1997."},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"H.& Karloff and U. Zwick A 7\/8-approximation algorithm for MAX 3SAT? Proc. of FOCS\u201997, pp. 406\u2013415, 1997.","DOI":"10.1109\/SFCS.1997.646129"},{"key":"56_CR8","unstructured":"M. Motoki and R. Uehara Unique solution instance generation for the 3-Satisfiability (3SAT) problem. Gent, van Maaren, and Walsh, eds., SAT2000 Highlights of Satisfiability Research in the Year 2000, pp. 293\u2013307. IOS Press, 2000."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T03:32:15Z","timestamp":1739849535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}