{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:21:29Z","timestamp":1648981289472},"reference-count":10,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016fcp0006","type":"journal-article","created":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:36:03Z","timestamp":1488328563000},"page":"422-427","source":"Crossref","is-referenced-by-count":0,"title":["Autoreducibility and Completeness for Partial Multivalued Functions"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Shuji","family":"ISOBE","sequence":"first","affiliation":[{"name":"Department of Computer and Mathematical Sciences, Graduate School of Information Sciences, Tohoku University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eisuke","family":"KOIZUMI","sequence":"additional","affiliation":[{"name":"Department of Computer and Mathematical Sciences, Graduate School of Information Sciences, Tohoku University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] H. Buhrman, L. Fortnow, D. van Melkebeek and L. Torenvliet, \u201cSeparating complexity classes using autoreducibility,\u201d SIAM J. Comput., vol.29, pp.1497-1520, 2000.","DOI":"10.1137\/S0097539798334736"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] P. Faliszewski and M. Ogihara, \u201cOn the Autoreducibility of Functions,\u201d Theory Comput. Syst., vol.46, pp.222-245, 2010.","DOI":"10.1007\/s00224-008-9127-9"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Fenner, S. Homer, M. Ogihara, and A. Selman, \u201cOracles that compute values,\u201d SIAM J. Comput., vol.26, no.4, pp.1043-1065, 1997.","DOI":"10.1137\/S0097539793247439"},{"key":"4","unstructured":"[4] K. Fleszar, C. Gla\u00dfer, F. Lipp, C. Reitwie\u00dfner, and M. Witek, \u201cThe Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions,\u201d Electronic Colloquium on Computational Complexity, TR11-053, 2011."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C. Gla\u00dfer, M. Ogihara, A. Pavan, A.L. Selman, and L. Zhang, \u201cAutoreducibility, mitoticity, and immunity,\u201d J. Comput. Syst. Sci., vol.73, no.5, pp.735-754, 2007.","DOI":"10.1016\/j.jcss.2006.10.020"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] J.-W. Huh, S. Isobe, E. Koizumi, and H. Shizuya, \u201cOn the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions,\u201d IEICE Trans. Inf. and Syst., vol.E96-D, no.3, pp.465-471, 2013.","DOI":"10.1587\/transinf.E96.D.465"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Ogiwara and O. Watanabe, \u201cPolynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets,\u201d SIAM J. Comput., vol.20, no.3, pp.471-483, 1991.","DOI":"10.1137\/0220030"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] A. Pagourtzis, and S. Zachos, \u201cThe complexity of counting functions with easy decision version,\u201d Proc. 31st International Symposium on Mathematical Foundations of Computer Science, LNCS, vol.4162, pp.741-752, Springer, Berlin, 2006.","DOI":"10.1007\/11821069_64"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] A.L. Selman, \u201cA Taxonomy of Complexity Classes of Functions,\u201d J. Comput. Syst. Sci., vol.48, no.2, pp.357-381, 1994.","DOI":"10.1016\/S0022-0000(05)80009-1"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] S. Toda, \u201cPP is as Hard as the Polynomial-Time Hierarchy,\u201d SIAM J. Comput., vol.20, no.5, pp.865-877, 1991.","DOI":"10.1137\/0220053"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016FCP0006\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T11:35:40Z","timestamp":1498390540000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016FCP0006\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016fcp0006","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}