{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:56Z","timestamp":1720640756952},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s1571-0653(04)00310-5","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"2-18","source":"Crossref","is-referenced-by-count":23,"special_numbering":"C","title":["Balance and Filtering in Structured Satisfiable Problems (Preliminary Report)"],"prefix":"10.1016","volume":"9","author":[{"given":"Henry","family":"Kautz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongshao","family":"Ruan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitris","family":"Achlioptas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla Gomes","family":"Bart Selman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Stickel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00310-5_BIB1","unstructured":"D. Achlioptas, C. Gomes, H. Kautz, B. Selman (2000). Generating Satisfiable Instances. Proc. AAAI-2000."},{"key":"10.1016\/S1571-0653(04)00310-5_BIB2","first-page":"46","article-title":"Using csp look-back techniques to solve exceptionally hard sat instances","author":"Bayardo","year":"1996","journal-title":"Proc. CP-96"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB3","first-page":"163","article-title":"Where the Really Hard Problems Are.","author":"Cheeseman","year":"1991","journal-title":"Proc. IJACI-91"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB4","series-title":"The Satisfiability Problem 35 of DIMACS Series in Discr. Math, and Theor. Comp. Sci.","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/035\/01","article-title":"Finding Hard Instances of the Satisfiability Problem: A Survey","author":"Cook","year":"1997"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB5","series-title":"On the bandwidth of random graphs","first-page":"633","author":"Fernandez de la V\u00e9ga","year":"1981"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB6","doi-asserted-by":"crossref","DOI":"10.1613\/jair.7","article-title":"An empirical analysis of search in GSAT","volume":"vol. 1","author":"Gent","year":"1993","journal-title":"J. of Artificial Intelligence Research"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0713023","article-title":"An algorithm for reducing the bandwidth and profile of a sparse matrix","volume":"13","author":"Gibbs","year":"1976","journal-title":"SIAM J. Numer. Anal"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB8","article-title":"Problem structure in the presence of perturbations","author":"Gomes","year":"1997","journal-title":"Proc. AAAI-97."},{"key":"10.1016\/S1571-0653(04)00310-5_BIB9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9904-1945-08361-X","article-title":"An existence theorem for latin squares","volume":"51","author":"Hall","year":"1945","journal-title":"Bull. Amer. Math Soc."},{"key":"10.1016\/S1571-0653(04)00310-5_BIB10","volume":"81","year":"1996"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB11","unstructured":"H. Hoos., SATLIB. A collection of SAT tools and data. See www.informatik.tudarmstadt.de\/AI\/SATLIB. 1999"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB12","article-title":"Pseudorandom number generation of one-way functions","author":"Impagliazzo","year":"1989","journal-title":"Proc. 21st STOC."},{"key":"10.1016\/S1571-0653(04)00310-5_BIB13","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behavior in the satisfiability of Boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB14","first-page":"366","article-title":"Heuristics based on unit propagation for satisfiability problems","author":"Li","year":"1997","journal-title":"Proc. IJACI-97"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB15","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992","journal-title":"Proc. AAAI-92"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB16","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSP","author":"Regin","year":"1994","journal-title":"Proc. AAAI-94"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB17","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1090\/S0002-9939-1951-0042361-0","article-title":"A combinatorial theorem with an application to latin rectangles","volume":"2","author":"Ryser","year":"1951","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S1571-0653(04)00310-5_BIB18","article-title":"A New Method for Solving Hard Satisfiability Problems","author":"Selman","year":"1992","journal-title":"Proc. AAAI-92."},{"key":"10.1016\/S1571-0653(04)00310-5_BIB19","article-title":"Arc consistency and quasigroup completion","author":"Shaw","year":"1998","journal-title":"Proc. ECAI-98, workshop"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0898-1221(94)00219-B","article-title":"Automated reasoning and exhaustive search: quasigroup existence problems","volume":"29","author":"Slaney","year":"1995","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB21","article-title":"The Difference All-Difference Makes","author":"Stergiou","year":"1999","journal-title":"Proc. of IJACI-99"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB22","author":"Van Gelder","year":"1993","journal-title":"Problem generator (mkcnf.c) contributed to the DI-MACS 1993 Challenge archive"},{"key":"10.1016\/S1571-0653(04)00310-5_BIB23","article-title":"SATO: An Efficient Propositional Prover","author":"Zhang","year":"1997","journal-title":"Proc. CADE-97"},{"issue":"1-2","key":"10.1016\/S1571-0653(04)00310-5_BIB24","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1006351428454","article-title":"Implementing the Davis-Putnam method","volume":"24","author":"Zhang","year":"2000","journal-title":"Journal of Automated Reasoning"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003105?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003105?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T15:49:05Z","timestamp":1549813745000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304003105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":24,"alternative-id":["S1571065304003105"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00310-5","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}