{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T20:00:18Z","timestamp":1693598418150},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0304-3975(95)00184-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"1-30","source":"Crossref","is-referenced-by-count":8,"title":["Length of prime implicants and number of solutions of random CNF formulae"],"prefix":"10.1016","volume":"215","author":[{"given":"Y.","family":"Boufkhad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Dubois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(95)00184-0_BIB1","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"620","article-title":"Miks gets some (the odds are on his side)","author":"Chv\u00e1tal","year":"1992"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB2","series-title":"Proc. 11th National Conf. on Artificial Intelligence","first-page":"21","article-title":"Experimental results on the crossover point in Satisfiablity Problems","author":"Crawford","year":"1993"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(95)00184-0_BIB4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","article-title":"An Assumption-Based TMS","volume":"28","author":"de Kleer","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/S0304-3975(95)00184-0_BIB5","series-title":"Second DIMACS Implementation Challenge","article-title":"SAT versus UNSAT","author":"Dubois","year":"1993"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1006\/jagm.1997.0867","article-title":"A general upper bound for the satisfiability threshold of random r-sat formulae","volume":"24","author":"Dubois","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB7","unstructured":"E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-sat problem, submitted."},{"key":"10.1016\/S0304-3975(95)00184-0_BIB8","series-title":"Mathematical Foundations of Computer Science","first-page":"264","article-title":"A threshold for unsatisfiability","author":"Goerdt","year":"1992"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB9","series-title":"Proc. System Safety Symp.","article-title":"Advanced concepts in fault tree analysis","author":"Hasl","year":"1965"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB10","series-title":"Urn Models and their Applications","author":"Johnson","year":"1977"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB11","series-title":"Random Allocations","author":"Kolchin","year":"1978"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB12","series-title":"Proc. Spring Symp. on A.I. and NP-Hard Problems","first-page":"112","article-title":"Evidence for a satisfiability threshold for random 3CNF formulas","author":"Larrabee","year":"1993"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB13","first-page":"267","article-title":"A Machine program for theorem proving","volume":"5","author":"Logemann","year":"1962","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(95)00184-0_BIB14","series-title":"Proc. ECAI-96 Workshop on Advances in Propositional Deduction","article-title":"Theory reasoning within implicant cover compilations","author":"Marquis","year":"1996"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB15","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1002\/j.1538-7305.1956.tb03835.x","article-title":"Minimization of boolean function","volume":"35","author":"McCluskey","year":"1959","journal-title":"Bell System Techniques"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB16","series-title":"Proc. AAAI'92","first-page":"459","article-title":"Hard and easy distribution of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB17","series-title":"Randomized Algorithms","author":"Motvani","year":"1995"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB18","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/2308219","article-title":"The problem of simplifying truth functions","volume":"59","author":"Quine","year":"1952","journal-title":"Amer. Math. Mon."},{"key":"10.1016\/S0304-3975(95)00184-0_BIB19","doi-asserted-by":"crossref","first-page":"627","DOI":"10.2307\/2307285","article-title":"A Way to simplify truth functions","volume":"62","author":"Quine","year":"1955","journal-title":"Amer. Math. Mon."},{"key":"10.1016\/S0304-3975(95)00184-0_BIB20","doi-asserted-by":"crossref","first-page":"755","DOI":"10.2307\/2310460","article-title":"On cores and prime implicants of truth functions","volume":"66","author":"Quine","year":"1959","journal-title":"Amer. Math. Mon."},{"key":"10.1016\/S0304-3975(95)00184-0_BIB21","series-title":"Proc. 6th AAAI","first-page":"183","author":"Reiter","year":"1987"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB22","series-title":"Proc. 13th National Conf. on Artificial Intelligence (AAAI 96)","article-title":"Compilation for critically constrained knowledge bases","author":"Schrag","year":"1996"},{"key":"10.1016\/S0304-3975(95)00184-0_BIB23","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/sapm1993893233","article-title":"Asymptotic estimates of Stirling numbers","volume":"89","author":"Temme","year":"1993","journal-title":"Studies in Applied Mathematics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397595001840?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397595001840?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:51:10Z","timestamp":1555375870000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397595001840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397595001840"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(95)00184-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}