{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:38:35Z","timestamp":1648903115905},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"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":5860,"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":[[1997,7]]},"DOI":"10.1016\/s0304-3975(96)00272-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"229-245","source":"Crossref","is-referenced-by-count":3,"title":["No NP problems averaging over ranking of distributions are harder"],"prefix":"10.1016","volume":"181","author":[{"given":"Jay","family":"Belanger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Jie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00272-1_BIB1_1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0022-0000(92)90019-F","article-title":"On the theory of average case complexity","volume":"44","author":"Ben-David","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB1_2","series-title":"Proc. 21st Ann. Symp. on Theory of Computing","first-page":"204","author":"Ben-David","year":"1989"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB2","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1137\/0222059","article-title":"Randomizing reductions of search problems","volume":"22","author":"Blass","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/S0097539792232070","article-title":"Matrix transformation is complete for the average case","volume":"24","author":"Blass","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB5","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB6","series-title":"Proc. 1st Ann. Internat. Computing and Combinatorics Conf.","first-page":"410","article-title":"Rankable distributions do not provide harder instances than uniform distributions","volume":"Vol. 959","author":"Belanger","year":"1995"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB7","series-title":"Proc. 2nd Annual Internat. Computing and Combinatorics Conf.","first-page":"300","article-title":"Reductions and convergence rates of average time","volume":"Vol. 1090","author":"Belanger","year":"1996"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB8","series-title":"Proc. 13th Annual Symp. Theoretical Aspects of Computer Science","first-page":"331","article-title":"Fine separation of average time complexity classes","volume":"Vol. 1046","author":"Cai","year":"1996"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(94)90048-5","article-title":"On average time hierarchies","volume":"49","author":"Goldmann","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB10","first-page":"112","article-title":"The challenger-solver game: variations on the theme of P = ? NP","author":"Gurevich","year":"1989","journal-title":"Bull. Eur. Assoc. for Theoretical Computer Science"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB11","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0022-0000(91)90007-R","article-title":"Average case completeness","volume":"42","author":"Gurevich","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB12","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0216034","article-title":"Expected computation time for Hamiltonian path problem","volume":"16","author":"Gurevich","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB13","first-page":"54","article-title":"Properties of logarithmico-exponential functions","volume":"10","author":"Hardy","year":"1911"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB14","series-title":"Proc. 31th Ann. 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\/S0304-3975(96)00272-1_BIB15","series-title":"Proc. 25th Ann. Symp. on Theory of Computing","first-page":"602","article-title":"Constant time factors do matter","author":"Jones","year":"1993"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB16_1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0215020","article-title":"Average case complete problems","volume":"15","author":"Levin","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB16_2","series-title":"Proc. 16th Symp. on Theory of Computing","first-page":"465","author":"Levin","year":"1984"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB17","series-title":"Proc. 10th Annual Symp. on Theoretical Aspects of Computer","first-page":"650","article-title":"Precise average case complexity","volume":"Vol. 665","author":"Reischuk","year":"1993"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB18","series-title":"Proc. 10th Ann. Conf. on Structure in Complexity Theory","first-page":"148","article-title":"Towards average-case complexity analysis of NP optimization problems","author":"Schuler","year":"1995"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB19","series-title":"Proc. 20th Ann. Symp. on Theory of Computing","first-page":"217","article-title":"Random instances of a graph coloring problem are hard","author":"Venkatesan","year":"1988"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB20","series-title":"Proc. 24th Ann. Symp. on Theory of Computing","first-page":"632","article-title":"Average case intractability of diophantine and matrix problems","author":"Venkatesan","year":"1992"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB21","series-title":"Complexity Theory Retrospective II","article-title":"Average-case computational complexity theory","author":"Wang","year":"1997"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB22","series-title":"Proc. 27th Ann. Symp. on Theory of Computing","first-page":"325","article-title":"Average-case completeness of a word problem for groups","author":"Wang","year":"1995"},{"key":"10.1016\/S0304-3975(96)00272-1_BIB23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1006\/jcss.1995.1014","article-title":"On the NP-isomorphism problem with respect to random instances","volume":"50","author":"Wang","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB24","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(84)90013-9","article-title":"An O(1) expected time algorithm for the graph coloring problem","volume":"18","author":"Wilf","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00272-1_BIB25","series-title":"Probability with Martingales","author":"Williams","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002721?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002721?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:58:43Z","timestamp":1555405123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0304397596002721"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00272-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}