Document Open Access Logo

A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations

Authors Melissa Antonelli , Arnaud Durand , Juha Kontinen

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2024.10.pdf
  • Filesize: 0.88 MB
  • 18 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Complexity classes
  • Theory of computation → Circuit complexity
Keywords
  • Implicit computational complexity
  • parallel computation
  • ordinary differential equations
  • circuit complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Implicit computational complexity is an active area of theoretical computer science, which aims at providing machine-independent characterizations of relevant complexity classes. One of the seminal works in this field appeared in 1965, when Cobham introduced a function algebra closed under bounded recursion on notation to capture FP. Later on, several complexity classes have been characterized using limited recursion schemas. In this context, a new approach was recently introduced, showing that ordinary differential equations (ODEs) offer a natural tool for algorithmic design and providing a characterization of FP by an ODE-schema. The overall goal of the present work is precisely that of generalizing this approach to parallel computation, obtaining an original ODE-characterization for the small circuit classes FAC⁰ and FTC⁰.

Cite As Get BibTex

Melissa Antonelli, Arnaud Durand, and Juha Kontinen. A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations. In 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 306, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.MFCS.2024.10

Author Details

Melissa Antonelli
  • HIIT & University of Helsinki, Finland
Arnaud Durand
  • Université Paris Cité, France
Juha Kontinen
  • University of Helsinki, Finland

Funding

  • Antonelli, Melissa: Supported by HIIT and Maupertuis' SMR Programme, on behalf of the Institute Français in Helsinki, the French Embassy to Finland, the French Ministry of Higher Education, Research and Innovation in partnership with the Finnish Society for Science and Letters and the Finnish Academy of Sciences and Letters.
  • Durand, Arnaud: Supported by Maupertuis' SMR Programme.
  • Kontinen, Juha: Supported by the Academy of Finland grant 345634.

References

  1. B. Allen. Arithmetizing uniform NC. Ann. Pure Appl. Logic, 53:1-50, 1991. Google Scholar
  2. T. Arai. A bounded arithmetic AID for Frege systems. Ann. Pure Appl. Logic, 103:155-199, 2000. Google Scholar
  3. S. Arora and B. Barak. Computational Complexity: A Modern Approach. Cambridge University Press, 2007. Google Scholar
  4. D.A.M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC¹. J. of Comput. and Syst. Sc., 41:274-306, 1990. Google Scholar
  5. S. Bellantoni and S. Cook. A new recursion-theoretic characterization of poly-time functions. Comput. Complex., 2:97-110, 1992. Google Scholar
  6. J.H. Bennett. On Spectra. PhD thesis, Princeton University, 1962. Google Scholar
  7. M. Blanc and O. Bournez. A characterisation of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations. In Proc. MCU, pages 58-74, 2022. Google Scholar
  8. M. Blanc and O. Bournez. A characterisation of functions computable in polynomial time and space over the reals with discrete ordinary differential equations: simulation of Turing machines with analytic discrete ODEs. In Proc. MFCS, pages 21:1-21:15, 2023. Google Scholar
  9. G. Bonfante, R. Kahle, J.-Y. Marion, and I. Oitavem. Two function algebras defining functions in NC^k boolean circuits. Inf. and Comput., 2016. Google Scholar
  10. O. Bournez and A. Durand. A characterization of functions over the integers computable in polynomial time using discrete differential equations. Comput. Complex., 32(7), 2023. Google Scholar
  11. P.G. Clote. A sequential characterization of the parallel complexity class NC. Technical report, Boston College, 1988. Google Scholar
  12. P.G. Clote. Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC^k, NC^k and NC. In Buss S.R. and Scott P.J., editors, Feasible Mathematics: A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989, Progress in Computer Science and Applied Logic, pages 49-69. Birkhäuser, Boston, MA, 1990. Google Scholar
  13. P.G. Clote and G. Takeuti. Bounded arithmetic for NC, ALogTIME, L and NL. Ann. Pure and Appl. Logic, 56:73-117, 1992. Google Scholar
  14. P.G. Clote and G. Takeuti. First order bounded arithmetic and small complexity classes. In P.G. Clote and J.B. Remmel, editors, Feasible Mathematics II, pages 154-218. Birkhäuser, 1995. Google Scholar
  15. A. Cobham. The intrinsic computational difficulty of functions. In Logic, Methodology and Phylosophy of Science: Proc. 1964 International Congress, pages 24-30. Amsterdam: North-Holland, 1965. Google Scholar
  16. K.J. Compton and C. Laflamme. An algebra and a logic for NC¹. Inf. Comput., 87(1/2):240-262, 1990. Google Scholar
  17. S. Cook and T. Morioka. Quantified propositional calculus and a second-order theory for NC¹. Arch. Math. Logic, 44:711-749, 2005. Google Scholar
  18. S. Cook and P. Nguyen. Theories for TC⁰ and other small circuit classes. Log. Meth. Comput Sci., 2:1-40, 2006. Google Scholar
  19. M.L. Furst, J.B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. In Proc. 22nd Annual Symposium on Foundations of Computer Science, pages 260-270, 1981. Google Scholar
  20. A. Grzegorczyk. Some classes of recursive functions. Rozptawy Matematyczne, 4, 1953. Google Scholar
  21. Y. Gurevich and H. Lewis. A logic for constant-depth circuit. Inf. Control, 61:65-74, 1984. Google Scholar
  22. L. Hella, J. Kontinen, and K. Luosto. Regular representations of uniform TC⁰. URL: https://arxiv.org/abs/2309.06926.
  23. N. Immerman. Languages that capture complexity classes. SIAM J. Comput., 16:760-778, 1987. Google Scholar
  24. J. Johannsen. A bounded arithmetic theory for constant depth threshold circuits. In GÖDEL '96, volume 6 of Springer Lecture Notes in Logic, pages 224-234. Hájek, P., 1996. Google Scholar
  25. D. Leivant. Ramified recurrence and computational complexity I: Word recurrence and poly-time. In P.G. Clote and J.B. Remmel, editors, Feasible Mathematics II, Progress in Computer Science and Applied Logic, pages 320-343. Birkhüser, 1994. Google Scholar
  26. D. Leivant and Y.-Y. Marion. Lambda calculus characterizations of poly-time. Fundam. Inform., 19(1,2):167-184, 1993. Google Scholar
  27. J.C. Lind. Computing in Logarithmic Space. PhD thesis, Massachusetts Institute of Technology, 1974. Google Scholar
  28. S. Lindell. A purely logical characterization of circuit uniformity. In 7th Structure in Complexity Theory Conf., pages 185-192, 1992. Google Scholar
  29. R.W. Ritchie. Classes of predicability computable functions. Trans. Am. Math. Soc., 106:139-173, 1963. Google Scholar
  30. H. Vollmer. Introduction to Circuit Complexity: A Uniform Approach. Springer, 1999. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact