Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions

Published 1 Jul 2023 in cs.CC and cs.LO | (2307.00363v1)

Abstract: We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the eventual inequality testing problem for real functions that are specified by homogeneous linear Cauchy problems with arbitrary real coefficients and initial values. In order to assign to this problem a well-defined computational complexity, we develop a natural notion of polynomial-time decidability of subsets of computable metric spaces which extends our recently introduced notion of maximal partial decidability. We show that eventual inequality of C-finite functions is polynomial-time decidable in this sense.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. On robustness for the skolem and positivity problems. In Petra Berenbrink and Benjamin Monmege, editors, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), volume 219 of LIPIcs, pages 5:1–5:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. doi:10.4230/LIPIcs.STACS.2022.5.
  2. Reachability in dynamical systems with rounding. In Nitin Saxena and Sunil Simon, editors, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference), volume 182 of LIPIcs, pages 36:1–36:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. doi:10.4230/LIPIcs.FSTTCS.2020.36.
  3. Algorithms in Real Algebraic Geometry. Springer-Verlag, Berlin, Heidelberg, 2006.
  4. On the positivity set of a linear recurrence. Israel Journal of Mathematics, 157:333 – 345, 2007. doi:10.1007/s11856-006-0015-1.
  5. The continuous Skolem-Pisot problem. Theoretical Computer Science, 411(40):3625–3634, 2010. doi:https://doi.org/10.1016/j.tcs.2010.06.005.
  6. Deux propriétés décidables des suites récurrentes linéaires. Bulletin de la Société Mathématique de France, 104:175–184, 1976. doi:10.24033/bsmf.1823.
  7. Vasco Brattka and Peter Hertling, editors. Handbook of Computability and Complexity in Analysis, Theory and Applications of Computability, Cham, 2021. Springer. doi:10.1007/978-3-030-59234-9.
  8. Computability on subsets of metric spaces. Theoretical Computer Science, 305(1 – 3):43 – 76, 2003.
  9. On recurrent reachability for continuous linear dynamical systems. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’16, pages 515–524, New York, NY, USA, 2016. Association for Computing Machinery. doi:10.1145/2933575.2934548.
  10. On the Skolem Problem for Continuous Linear Dynamical Systems. In Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi, editors, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55 of Leibniz International Proceedings in Informatics (LIPIcs), pages 100:1–100:13, Dagstuhl, Germany, 2016. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. doi:10.4230/LIPIcs.ICALP.2016.100.
  11. The pseudo-skolem problem is decidable. In Filippo Bonchi and Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia, volume 202 of LIPIcs, pages 34:1–34:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. doi:10.4230/LIPIcs.MFCS.2021.34.
  12. Recurrence Sequences. American Mathematical Society, 2003.
  13. When can we detect that a P-finite sequence is positive? In Wolfram Koepf, editor, Symbolic and Algebraic Computation, International Symposium, ISSAC 2010, Munich, Germany, July 25-28, 2010, Proceedings, pages 195–201. ACM, 2010.
  14. Complexity theory for operators in analysis. ACM Trans. Comput. Theory, 4(2):5:1–5:24, May 2012. doi:10.1145/2189778.2189780.
  15. Ker-I Ko. Complexity theory of real functions. Progress in Theoretical Computer Science. Birkhäuser Boston, Inc., Boston, MA, 1991. doi:10.1007/978-1-4684-6802-1.
  16. Some Examples of Non-Metrizable Spaces Allowing a Simple Type-2 Complexity Theory. Electronic Notes in Theoretical Computer Science, 120:111–123, 2005. Proceedings of the 6th Workshop on Computability and Complexity in Analysis (CCA 2004). doi:https://doi.org/10.1016/j.entcs.2004.06.038.
  17. Eike Neumann. Decision problems for linear recurrences involving arbitrary real numbers. Logical Methods in Computer Science, 17(3), 2021. doi:10.46298/lmcs-17(3:16)2021.
  18. Parametrised second-order complexity theory with applications to the study of interval computation. Theoretical Computer Science, 806:281 – 304, 2020. URL: https://doi.org/10.1016/j.tcs.2019.05.009.
  19. On the positivity problem for simple linear recurrence sequences,. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, volume 8573 of Lecture Notes in Computer Science, pages 318–329. Springer, 2014. doi:10.1007/978-3-662-43951-7_27.
  20. Positivity problems for low-order linear recurrence sequences. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 366–379. SIAM, 2014. doi:10.1137/1.9781611973402.27.
  21. Ultimate positivity is decidable for simple linear recurrence sequences. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, volume 8573 of Lecture Notes in Computer Science, pages 330–341. Springer, 2014. doi:10.1007/978-3-662-43951-7_28.
  22. On linear recurrence sequences and loop termination. ACM SIGLOG News, 2(2):4–13, 2015. URL: https://dl.acm.org/citation.cfm?id=2766191.
  23. An efficient procedure deciding positivity for a class of holonomic sequences. ACM Communications in Computer Algebra, 49(3):90–93, 2015. Extended abstract of the poster presentation at ISSAC 2015.
  24. Matthias Schröder. Spaces Allowing Type-2 Complexity Theory Revisited. Mathematical Logic Quarterly, 50(45):443–459, 2004. doi:10.1002/malq.200310111.
  25. Arnold Schönhage. The fundamental theorem of algebra in terms of computational complexity. Preliminary Report, Mathematisches Institut der Universität Tübingen, 1982.
  26. The distance between terms of an algebraic recurrence sequence. Journal für die reine und angewandte Mathematik, 349:63–76, 1984. URL: http://eudml.org/doc/152622.
  27. N.K. Vereshchagin. Occurrence of zero in a linear recursive sequence. Mat. Zametki, 38(2):177 – 189, 1985.
  28. Klaus Weihrauch. Computable Analysis. Springer, 2000.
  29. Computability in linear algebra. Theoretical Computer Science, 326(1-3):187–211, 2004.
Citations (2)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (1)

  1. Eike Neumann 

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up