Abstract
Type-two Theory of Effectivity (TTE) provides a general framework for Computable Analysis. To refine it to polynomial-time computability while keeping as much generality as possible, Kawamura and Cook recently proposed a modification to TTE using machines that have random access to an oracle and run in time depending on the “size” of the oracle. They defined type-two analogues of P, NP, PSPACE and applied them to real functions and operators. We further refine their model and study computation below P: type-two analogues of the classes L, NC, and P-completeness under log-space reductions. The basic idea is to use second-order polynomials as resource bounds, as Kawamura and Cook did, but we need to make some nontrivial (yet natural, as we will argue) choices when formulating small classes in order to make them well-behaved. Most notably: we use a modification of the constant stack model of Aehlig, Cook and Nguyen for query tapes in order to allow sufficient oracle accesses without interfering with space bounds; representations need to be chosen carefully, as computational equivalence between them is now finer; uniformity of circuits must be defined with varying sizes of oracles taken into account. As prototypical applications, we recast several facts (some in a stronger form than was known) about the complexity of numerical problems into our framework.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aehlig, K., Cook, S., Nguyen, P.: Relativizing small complexity classes and their theories. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 374–388. Springer, Heidelberg (2007)
Ambos-Spies, K., Brandt, U., Ziegler, M.: Real benefit of promises and advice. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 1–11. Springer, Heidelberg (2013)
Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. Journal of Computer and System Sciences 57(1), 3–19 (1998)
Brattka, V., Hertling, P., Weihrauch, K.: A tutorial on computable analysis. In: New Computational Paradigms. Springer (2008)
Buss, J.F.: Relativized alternation and space-bounded computation. Journal of Computer and System Sciences 36(3), 351–378 (1988)
Chiu, A., Davida, G., Litow, B.: Division in logspace-uniform NC1. RAIRO-Theoretical Informatics and Applications 35(03), 259–275 (2001)
Férée, H., Hoyrup, M.: Higher-order complexity in analysis. In: Proc. CCA 2013, pp. 22–35 (2013)
Hoover, H.J.: Real functions, contraction mappings, and P-completeness. Information and Computation 93(2), 333–349 (1991)
Kawamura, A.: On function spaces and polynomial-time computability. Dagstuhl Seminar 11411: Computing with Infinite Data (2011)
Kawamura, A., Cook, S.: Complexity theory for operators in analysis. ACM Transactions on Computation Theory 4(2), Article 5 (2012)
Ko, K.I.: Complexity theory of real functions. Birkhauser Boston Inc. (1991)
Ladner, R.E., Lynch, N.A.: Relativization of questions about log space computability. Theory of Computing Systems 10(1), 19–32 (1976)
Neff, C.A.: Specified precision polynomial root isolation is in NC. Journal of Computer and System Sciences 48(3), 429–463 (1994)
Rettinger, R.: Computational complexity in analysis (extended abstract). In: CCA 2013, pp. 100–109 (2013)
Rösnick, C.: Closed sets and operators thereon: representations, computability and complexity. In: Proc. CCA 2013, pp. 110–121 (2013)
Weihrauch, K.: Computable Analysis: An Introduction. Springer (2000)
Wilson, C.B.: A measure of relativized space which is faithful with respect to depth. Journal of Computer and System Sciences 36(3), 303–312 (1988)
Ziegler, M.: Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. Annals of Pure and Applied Logic 163(8), 1108–1139 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawamura, A., Ota, H. (2014). Small Complexity Classes for Computable Analysis. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-662-44465-8_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44464-1
Online ISBN: 978-3-662-44465-8
eBook Packages: Computer ScienceComputer Science (R0)