{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:03:37Z","timestamp":1649016217335},"reference-count":14,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1051\/ita:2001101","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:10:48Z","timestamp":1068822648000},"page":"367-377","source":"Crossref","is-referenced-by-count":0,"title":["The Helping Hierarchy"],"prefix":"10.1051","volume":"35","author":[{"given":"Patrizio","family":"Cintioli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,4,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"V. Arvind, A Note on the Self-Witnessing Property of Computational Problems,Proc. 2nd Annual International Conference on Computing and Combinatorics (COCOON'96). Springer-Verlag,Lecture Notes in Comput. Sci.1090(1996) 241-249.","DOI":"10.1007\/3-540-61332-3_157"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, Self-reducibility,Proc. 4th Symposium on Theoretical Aspects of Computer Science. Springer-Verlag,Lecture Notes in Comput. Sci.247(1987) 136-147.","DOI":"10.1007\/BFb0039601"},{"key":"R3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.5209\/rev_REMA.1989.v2.n2.18114","volume":"2","author":"Balc\u00e1zar","year":"1989","journal-title":"Rev. Mat. Complut."},{"key":"R4","unstructured":"D.P. Bovet and P. Crescenzi,Introduction to the Theory of Complexity. Prentice-Hall (1994)."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz and J. Gabarr\u00f3,Structural Complexity I, Vol. 1. Springer-Verlag (1988).","DOI":"10.1007\/978-3-642-97062-7_1"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz and J. Gabarr\u00f3,Structural Complexity II, Vol. 2. Springer-Verlag (1990).","DOI":"10.1007\/978-3-642-75357-2"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"J. Cai, L. Hemachandra and J. Viskoc, Promises Problems and Access to Unambiguous Computation,Proc. 17th Symposium on Mathematical Foundations of Computer Science. Springer-Verlag,Lecture Notes in Comput. Sci.629(1992) 162-171.","DOI":"10.1007\/3-540-55808-X_14"},{"key":"R8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02679447","volume":"30","author":"Cintioli","year":"1997","journal-title":"Theory Comput. Syst."},{"key":"R9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0020-0190(97)00197-X","volume":"61","author":"Cintioli","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"M. Fellows and N. Koblitz, Self-witnessing polynomial time complexity and prima factorization, inProc. 6th Structure in Complexity Theory Conference(1992) 107-110.","DOI":"10.1109\/SCT.1992.215385"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"L. Hemachandra, Fault-Tolerance and Complexity, inProc. 20th International Colloquium on Automata, Languages, and Programming. Springer-Verlag,Lecture Notes in Comput. Sci.(1993).","DOI":"10.1007\/3-540-56939-1_72"},{"key":"R12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(87)90078-8","volume":"52","author":"On Helping","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"R13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(94)00232-N","volume":"54","author":"Ogihara","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"R14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(85)90158-6","volume":"40","author":"Sch\u00f6ning","year":"1985","journal-title":"Theoret. Comput. Sci."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001101\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,23]],"date-time":"2018-03-23T11:29:45Z","timestamp":1521804585000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":14,"journal-issue":{"issue":"4"},"alternative-id":["ita0132"],"URL":"https:\/\/doi.org\/10.1051\/ita:2001101","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}