{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:11:58Z","timestamp":1780319518487,"version":"3.54.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,26]],"date-time":"2004-03-26T00:00:00Z","timestamp":1080259200000},"content-version":"vor","delay-in-days":5198,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990]]},"DOI":"10.1016\/0304-3975(90)90138-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"217-225","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"title":["Robust machines accept easy sets"],"prefix":"10.1016","volume":"74","author":[{"given":"Juns","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lane A.","family":"Hemachandra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90138-8_BIB1","first-page":"151","article-title":"Reducibility, randomness, and intractibility","author":"Adleman","year":"1977","journal-title":"Proc. 9th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90138-8_BIB2","series-title":"Automata, Languages, and Programming (ICALP 1989)","first-page":"31","article-title":"Lower bounds for the low hierarchy","volume":"372","author":"Allender","year":"1989"},{"key":"10.1016\/0304-3975(90)90138-8_BIB3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P=?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90138-8_BIB4","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00264313","article-title":"Sets with small generalized Kolmogorcv complexity","volume":"23","author":"Balc\u00e1zar","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90138-8_BIB5","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1137\/0215053","article-title":"Sparse sets, lowness and highness","volume":"15","author":"Balc\u00e1zar","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90138-8_BIB6","series-title":"Technical Report 88-04","article-title":"NP-Hard sets are P-superterse unless R=NP","author":"Beigel","year":"1988"},{"key":"10.1016\/0304-3975(90)90138-8_BIB7","series-title":"Proc. 4th Structure in Complexity Theory Conf.","first-page":"216","article-title":"On the relativized power of additional accepting paths","author":"Beigel","year":"1989"},{"key":"10.1016\/0304-3975(90)90138-8_BIB8","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1987.30","article-title":"Generic oracles and oracles classes","author":"Blum","year":"1987","journal-title":"28th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90138-8_BIB9","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0213030","article-title":"Quantitative relativizations of complexity classes","volume":"13","author":"Book","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90138-8_BIB10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0022-0000(85)90053-4","article-title":"Qualitative relativizations of complexity classes","volume":"30","author":"Book","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90138-8_BIB11","series-title":"Technical Report TR 76-284","article-title":"Some comments on functional self-reducibility and the NP hierarchy","author":"Borodin","year":"1976"},{"key":"10.1016\/0304-3975(90)90138-8_BIB12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"17","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90138-8_BIB13","series-title":"Automata, Languages, and Programming (ICALP 1986)","first-page":"123","article-title":"Complexity classes without machines: on complete languages for UP","volume":"226","author":"Hartmanis","year":"1986"},{"key":"10.1016\/0304-3975(90)90138-8_BIB14","series-title":"Proc. 2nd Structure in Complexity Theory Conf.","first-page":"160","article-title":"One-way functions, robustness, and the non-isomorphism of NP-complete sets","author":"Hartmanis","year":"1987"},{"key":"10.1016\/0304-3975(90)90138-8_BIB15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines: on complete languages for UP","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90138-8_BIB16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0020-0190(88)90176-7","article-title":"On sparse oracles separating feasible complexity classes","volume":"28","author":"Hartmanis","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(90)90138-8_BIB17","series-title":"Mathematical Foundations of Computer Science 1988, Proc. 13th Symp.","first-page":"59","article-title":"Structure of complexity classes: separations, collapses, and completeness","volume":"324","author":"Hemachandra","year":"1988"},{"key":"10.1016\/0304-3975(90)90138-8_BIB18","series-title":"9th Conf. on Foundations of Software Technology and Theoretical Computer Science (FST-TCS 1989)","first-page":"193","article-title":"On the limitations of locally robust positive reductions","author":"Hemachandra","year":"1989"},{"key":"10.1016\/0304-3975(90)90138-8_BIB19","series-title":"Proc. 2nd Structure in Complexity Theory Conf.","first-page":"182","article-title":"On helping by robust oracle machines","author":"Ko","year":"1987"},{"key":"10.1016\/0304-3975(90)90138-8_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(82)90085-8","article-title":"Strong nondeterministic polynomial-time reducibilities","volume":"21","author":"Long","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90138-8_BIB21","series-title":"Studies in Complexity Theory","first-page":"63","article-title":"Sparse sets and reducibilities","author":"Mahaney","year":"1986"},{"key":"10.1016\/0304-3975(90)90138-8_BIB22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/322290.322306","article-title":"Relativized questions involving probabilistic algorithms","volume":"29","author":"Rackoff","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90138-8_BIB23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(85)90158-6","article-title":"Robust algorithms: a different approach to oracles","volume":"40","author":"Sch\u00f6ning","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90138-8_BIB24","article-title":"Complexity and Structure","volume":"211","author":"Sch\u00f6ning","year":"1986"},{"key":"10.1016\/0304-3975(90)90138-8_BIB25","series-title":"Proc. 2nd Structure in Complexity Theory Conf.","first-page":"2","article-title":"Probabilistic complexity classes and lowness","author":"Sch\u00f6ning","year":"1987"},{"key":"10.1016\/0304-3975(90)90138-8_BIB26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(90)90138-8_BIB27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","article-title":"Reductions on NP and P-selective sets","volume":"19","author":"Selman","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90138-8_BIB28","author":"Tardos","year":"1987","journal-title":"Query complexity, or why is it difficult to separate NPA\u2229coNPA from PA by random oracles A"},{"key":"10.1016\/0304-3975(90)90138-8_BIB29","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"The relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(90)90138-8_BIB30","first-page":"458","article-title":"NP is as easy as detecting unique solutions","author":"Valiant","year":"1985","journal-title":"17th ACM Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590901388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590901388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:40:57Z","timestamp":1780317657000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397590901388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990]]}},"alternative-id":["0304397590901388"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90138-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robust machines accept easy sets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90138-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}