{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:08Z","timestamp":1744217408246},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0022-0000(92)90019-f","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"193-219","source":"Crossref","is-referenced-by-count":91,"title":["On the theory of average case complexity"],"prefix":"10.1016","volume":"44","author":[{"given":"Shai","family":"Ben-David","sequence":"first","affiliation":[]},{"given":"Benny","family":"Chor","sequence":"additional","affiliation":[]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Luby","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90019-F_BIB1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","author":"Carter","year":"1979","journal-title":"Comput. System Sc. J."},{"key":"10.1016\/0022-0000(92)90019-F_BIB2","series-title":"Proceedings, 3rd ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(92)90019-F_BIB3","series-title":"A Completeness Theorem for Almost Everywhere Invulnerable Generators","author":"Feigenbaum","year":"1989"},{"key":"10.1016\/0022-0000(92)90019-F_BIB4","series-title":"Computers and Intractability: A guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(92)90019-F_BIB5","article-title":"Towards a Theory of Average Case Complexity (A Survey)","author":"Goldreich","year":"1988"},{"key":"10.1016\/0022-0000(92)90019-F_BIB6","series-title":"Proceedings, 28th IEEE Symp. on Foundation of Computer Science","first-page":"111","article-title":"Complete and incomplete randomized NP problems","author":"Gurevich","year":"1987"},{"key":"10.1016\/0022-0000(92)90019-F_BIB7","series-title":"Proceedings 31st IEEE Symp. on Foundation of Computer Science","first-page":"802","article-title":"Matrix decomposition problem is complete for the average case","author":"Gurevich","year":"1990"},{"key":"10.1016\/0022-0000(92)90019-F_BIB8","series-title":"Average case complete problems","author":"Gurevich","year":"1987"},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90019-F_BIB9","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.2307\/2274767","article-title":"Time polynomial in input or output","volume":"54","author":"Gurevich","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(92)90019-F_BIB10","series-title":"Proceedings, 22nd ACM Symp. on Theory of Computing","first-page":"395","article-title":"Pseudo-random generators with uniform assumptions","author":"Hastad","year":"1990"},{"key":"10.1016\/0022-0000(92)90019-F_BIB11","series-title":"Advances in Cryptography \u2014 CRYPTO'88","first-page":"297","article-title":"On generating solved instances of computational problems","author":"Hemachandra","year":"1990"},{"key":"10.1016\/0022-0000(92)90019-F_BIB12","series-title":"Proceedings, 31st IEEE Symp. on Foundations of Computer Science","first-page":"812","article-title":"No better ways to generate hard NP instances than picking Uniformly at random","author":"Impagliazzo","year":"1990"},{"key":"10.1016\/0022-0000(92)90019-F_BIB13","series-title":"Proceedings, ACM Symp. on Theory of Computing","first-page":"12","article-title":"Pseudorandom number generation from any one-way function","author":"Implagliazzo","year":"1989"},{"key":"10.1016\/0022-0000(92)90019-F_BIB14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0196-6774(84)90032-4","article-title":"The NP-complete Column \u2014 An ongoing guide","volume":"4","author":"Johnson","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(92)90019-F_BIB15","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(92)90019-F_BIB16","series-title":"Probabilistic analysis of algorithms","author":"Karp","year":"1986"},{"key":"10.1016\/0022-0000(92)90019-F_BIB17","series-title":"Proceedings, 17th ACM Symp. on Theory of Computing","first-page":"464","article-title":"Are search and decision problems computationally equivalent?","author":"Karp","year":"1985"},{"key":"10.1016\/0022-0000(92)90019-F_BIB18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90019-F_BIB19_1","first-page":"115","article-title":"Universal search problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problemy Peredaci Inlormacii"},{"key":"10.1016\/0022-0000(92)90019-F_BIB19_2","first-page":"265","article-title":"Universal search problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0022-0000(92)90019-F_BIB20_1","first-page":"285","article-title":"Average case complete problems","volume":"15","author":"Levin","year":"1986"},{"key":"10.1016\/0022-0000(92)90019-F_BIB20_2","series-title":"Proceedings, 16th ACM Symp. on Theory of Computing","first-page":"465","author":"Levin","year":"1984"},{"key":"10.1016\/0022-0000(92)90019-F_BIB21","series-title":"Proceedings, 17th ACM Symp. on Theory of Computing","first-page":"363","article-title":"One-way function and pseudorandom generators","author":"Levin","year":"1985"},{"key":"10.1016\/0022-0000(92)90019-F_BIB22","series-title":"Proceedings, 29th IEEE Symp. on Foundations of Computer Science","first-page":"36","article-title":"Homogeneous measures and polynomial time invariants","author":"Levin","year":"1988"},{"key":"10.1016\/0022-0000(92)90019-F_BIB23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90019-F_BIB24","series-title":"Proceedings, 15th ACM Symp. on Theory of Computing","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983"},{"key":"10.1016\/0022-0000(92)90019-F_BIB25","series-title":"Proceedings, 15th ACM Symp. on Theory of Computing","first-page":"118","article-title":"The complexity of approximate counting","author":"Stockmeyer","year":"1983"},{"key":"10.1016\/0022-0000(92)90019-F_BIB26","series-title":"Proceedings, 17th ACM Symp. on Theory of Computing","first-page":"458","article-title":"NP is as easy as detecting unique solutions","author":"Valiant","year":"1985"},{"key":"10.1016\/0022-0000(92)90019-F_BIB27","series-title":"Proceedings, 20th ACM Symp. on Theory of Computing","first-page":"217","article-title":"Random instances of a graph coloring problem are hard","author":"Venkatesan","year":"1988"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290019F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290019F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:57:01Z","timestamp":1550325421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290019F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002200009290019F"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90019-f","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}