Implicit complexity over an arbitrary structure: Quantifier alternations
- 1 February 2006
- journal article
- Published by Elsevier in Information and Computation
- Vol. 204 (2) , 210-230
- https://doi.org/10.1016/j.ic.2005.07.005
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial TimeJournal of Logic and Computation, 2005
- Computability over an Arbitrary Structure. Sequential and Parallel Polynomial TimePublished by Springer Nature ,2003
- The expressive power of higher-order types or, life without CONSJournal of Functional Programming, 2001
- The Logic of ChoiceThe Journal of Symbolic Logic, 2000
- Logics which capture complexity classes over the realsThe Journal of Symbolic Logic, 1999
- Tailoring recursion for complexityThe Journal of Symbolic Logic, 1995
- Computation models and function algebrasLecture Notes in Computer Science, 1995
- Ramified recurrence and computational complexity II: Substitution and poly-spacePublished by Springer Nature ,1995
- On the Complexity of Quantifier Elimination: the Structural ApproachThe Computer Journal, 1993
- A new recursion-theoretic characterization of the polytime functionscomputational complexity, 1992