Abstract
In this paper, a global function is a function that computes a (local) function in each ordered structure of a specified vocabulary. We design algebras of global functions for a number of complexity classes for which such algebras have not been known, e.g. for the functions computable in nondeterministic logarithmic space, or in nondeterministic polynomial time. In addition, we present a functional analogue of first-order logic and give a new functional characterization of polynomial time.
Partially supported by NSF and ONR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and V. Vianu, Datalog Extensions for Database Queries and Updates, J. Computer and System Sciences 43 (1991), 62–124.
K. Compton and C. Laflamme, An Algebra and a Logic for NC 1, Information and Computation 87 (1990), 241–263.
R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, SIAM-AMS Proc. 7 (1974), 43–73.
A. Goerdt, Characterizing complexity classes by general recursive definitions in higher types, Proceedings of CSL '88, Lecture Notes in Computer Science Nr. 385, Springer (1989), 99–117.
E. Grädel, Capturing Complexity Classes by Fragments of Second Order Logic, Theoretical Computer Science 101 (1992), 35–57.
E. Grädel and M. Otto, Inductive Definability with Counting on Finite Structures, Proceedings of CSL92, Lecture Notes in Computer Science Nr. 702 (1993), 231–247.
Y. Gurevich, Algebras of feasible functions, Proceedings of 24th IEEE Symposium on Foundations of Computer Science 1983, 210–214.
Y. Gurevich, Toward logic tailord for computational complexity, Computation and Proof Theory, Lecture Notes in Mathematics Nr. 1104, Springer (1984), 175–216.
Y. Gurevich, Logic and the Challenge of Computer Science, in: E. Börger (Ed), Trends in Theoretical Computer Science, Computer Science Press (1988), 1–57.
Y. Gurevich and H. Lewis, A Logic for Constant-Depth Circuits, Information and Control 61 (1984), 65–74.
N. Immerman, Descriptive and Computational Complexity, Proc. of AMS Symposia in Appl. Math. 38 (1989), 75–91.
Libo Lo, Functions and Functionals on Finite Systems, Journal of Symbolic Logic 57 (1992), 118–130.
V. Sazonov, Polynomial computability and recursivity in finite domains, Elektronische Datenverarbeitung und Kybernetik 16 (1980), 319–323.
M. Vardi, Complexity of Relational Query Languages, Proc. of 14th Symposium on Theory of Computing (1982), 137–146.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grädel, E., Gurevich, Y. (1994). Tailoring recursion for complexity. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_62
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_62
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive