{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:24:45Z","timestamp":1729661085091,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029840","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:14:31Z","timestamp":1056564871000},"page":"325-334","source":"Crossref","is-referenced-by-count":2,"title":["Unsatisfiable random formulas are hard to certify"],"prefix":"10.1109","author":[{"given":"A.","family":"Atserias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/0003-4843(80)90014-5"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-1988-0924703-8"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1055"},{"journal-title":"Database and knowledge-base systems","year":"1989","author":"ullman","key":"23"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1713"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90065-P"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2307\/2272945"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00045-3"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2002.3114"},{"key":"20","first-page":"21","article-title":"A note on the expressive power of Prolog","volume":"26","author":"papadimitriou","year":"1985","journal-title":"Bullentin of the EATCS"},{"key":"2","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/SFCS.2000.892327","article-title":"Optimal myopic algorithms for random 3-SAT","author":"achlioptas","year":"2000","journal-title":"The 43rd Annual IEEE Symposium on Foundations of Computer Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00159-1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267789"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375835"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1109\/SFFCS.1999.814613","article-title":"Random CNF's are hard for the polynomial calculus","author":"ben-sasson","year":"1999","journal-title":"40th Annual Symp Foundations Computer Science"},{"key":"5","article-title":"Space complexity of random formulas in resolution","author":"ben-sasson","year":"2001","journal-title":"IEEE Conference on Computational Complexity"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369156"},{"key":"9","first-page":"322","article-title":"On the satisliability and maximum satisfiability or random 3-CNF formulas","author":"broder","year":"1993","journal-title":"ACM-SIAM Annu Symp Discrete Algorithms"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190030305"}],"event":{"name":"17th Annual IEEE Symposium on Logic in Computer Science","acronym":"LICS-02","location":"Copenhagen, Denmark"},"container-title":["Proceedings 17th Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8005\/22127\/01029840.pdf?arnumber=1029840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:42:32Z","timestamp":1497552152000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029840","relation":{},"subject":[]}}