{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:32:30Z","timestamp":1743049950612,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_1","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T17:27:59Z","timestamp":1267550879000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Notions of Average-Case Complexity for Random 3-SAT"],"prefix":"10.1007","author":[{"given":"Albert","family":"Atserias","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Beame, P., Karp, R., Pitassi, T., Saks, M.: The efficiency of resolution and Davis-Putnam procedures. SIAM Journal of Computing, 1048\u20131075 (2002)","DOI":"10.1137\/S0097539700369156"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem proving procedures. 3rd Annual ACM Symposium on the Theory of Computing, 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-48224-5_26","volume-title":"Automata, Languages and Programming","author":"J. Friedman","year":"2001","unstructured":"Friedman, J., Goerdt, A.: Recognizing more unsatisfiable random 3-SAT instances efficiently. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 310\u2013321. Springer, Heidelberg (2001)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. Hastad","year":"2001","unstructured":"Hastad, J.: Some optimal inapproximability results. Journal of the ACM\u00a048, 798\u2013859 (2001)","journal-title":"Journal of the ACM"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. 10th IEEE Structure in Complexity Theory, 134\u2013147 (1995)","DOI":"10.1109\/SCT.1995.514853"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:00:41Z","timestamp":1739919641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}