Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Existential Theory of the Reals with Summation Operators (2405.04697v2)

Published 7 May 2024 in cs.CC and cs.LO

Abstract: To characterize the computational complexity of satisfiability problems for probabilistic and causal reasoning within the Pearl's Causal Hierarchy, arXiv:2305.09508 [cs.AI] introduce a new natural class, named succ-$\exists$R. This class can be viewed as a succinct variant of the well-studied class $\exists$R based on the Existential Theory of the Reals (ETR). Analogously to $\exists$R, succ-$\exists$R is an intermediate class between NEXP and EXPSPACE, the exponential versions of NP and PSPACE. The main contributions of this work are threefold. Firstly, we characterize the class succ-$\exists$R in terms of nondeterministic real RAM machines and develop structural complexity theoretic results for real RAMs, including translation and hierarchy theorems. Notably, we demonstrate the separation of $\exists$R and succ-$\exists$R. Secondly, we examine the complexity of model checking and satisfiability of fragments of existential second-order logic and probabilistic independence logic. We show succ-$\exists$R- completeness of several of these problems, for which the best-known complexity lower and upper bounds were previously NEXP-hardness and EXPSPACE, respectively. Thirdly, while succ-$\exists$R is characterized in terms of ordinary (non-succinct) ETR instances enriched by exponential sums and a mechanism to index exponentially many variables, in this paper, we prove that when only exponential sums are added, the corresponding class $\exists$R{\Sigma} is contained in PSPACE. We conjecture that this inclusion is strict, as this class is equivalent to adding a VNP-oracle to a polynomial time nondeterministic real RAM. Conversely, the addition of exponential products to ETR, yields PSPACE. Additionally, we study the satisfiability problem for probabilistic reasoning, with the additional requirement of a small model and prove that this problem is complete for $\exists$R{\Sigma}.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. The art gallery problem is ∃ℝℝ\exists\mathbb{R}∃ blackboard_R-complete. In Proc. of the 50th ACM SIGACT Symposium on Theory of Computing, pages 65–73, 2018.
  2. Training neural networks is ∃ℝℝ\exists\mathbb{R}∃ blackboard_R-complete. Advances in Neural Information Processing Systems, 34:18293–18306, 2021.
  3. On Pearl’s Hierarchy and the Foundations of Causal Inference, pages 507–556. Association for Computing Machinery, New York, NY, USA, 2022.
  4. ∃ℝℝ\exists\mathbb{R}∃ blackboard_R-complete decision problems about symmetric Nash equilibria in symmetric multi-player games. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.
  5. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21(1):1–46, 1989.
  6. Peter Bürgisser. Completeness and reduction in algebraic complexity theory, volume 7. Springer Science & Business Media, 2000.
  7. John Canny. Some algebraic and geometric computations in PSPACE. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 460–467. ACM, 1988.
  8. Jean Cardinal. Computational geometry column 62. ACM SIGACT News, 46(4):69–78, 2015.
  9. Stephen A Cook. A hierarchy for nondeterministic time complexity. In Proceedings of the fourth annual ACM symposium on Theory of computing, pages 187–192, 1972.
  10. Laszlo Csanky. Fast parallel matrix inversion algorithms. SIAM Journal on Computing, 5(4):618–623, 1976.
  11. Homomorphism polynomials complete for VP. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2014.
  12. Probabilistic team semantics. In Foundations of Information and Knowledge Systems: 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14–18, 2018, Proceedings 10, pages 186–206. Springer, 2018.
  13. Smoothing the gap between NP and ER. SIAM Journal on Computing, pages FOCS20–102, 2022.
  14. A logic for reasoning about probabilities. Information and computation, 87(1-2):78–128, 1990.
  15. ∃ℝℝ\exists\mathbb{R}∃ blackboard_R-completeness for decision versions of multi-player (symmetric) Nash equilibria. ACM Transactions on Economics and Computation (TEAC), 6(1):1–23, 2018.
  16. Probabilistic satisfiability. Journal of Complexity, 4(1):1–11, 1988.
  17. Dima Grigoriev and Nicolai N. Vorobjov Jr. Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput., 5(1/2):37–64, 1988.
  18. Descriptive complexity of real computation and probabilistic independence logic. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, pages 550–563, 2020.
  19. Logics with probabilistic team semantics and the boolean negation. arXiv preprint arXiv:2306.00420, 2023.
  20. Probabilistic reasoning across the causal hierarchy. In The 34th AAAI Conference on Artificial Intelligence, AAAI 2020, pages 10170–10177. AAAI Press, 2020.
  21. Parallel algorithms for shared-memory machines. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pages 869–942. Elsevier and MIT Press, 1990.
  22. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9:1–36, 1998.
  23. Meena Mahajan. Algebraic complexity classes. Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume, pages 51–75, 2014.
  24. Integer realizations of disk and segment graphs. Journal of Combinatorial Theory, Series B, 103(1):114–143, 2013.
  25. Is causal reasoning harder than probabilistic reasoning? The Review of Symbolic Logic, pages 1–26, 2022.
  26. Nils J Nilsson. Probabilistic logic. Artificial Intelligence, 28(1):71–87, 1986.
  27. Judea Pearl. Causality. Cambridge University Press, 2009. ISBN 0-521-77362-8.
  28. James Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. Journal of symbolic computation, 13(3):255–299, 1992.
  29. Marcus Schaefer. Complexity of some geometric and topological problems. In International Symposium on Graph Drawing, pages 334–344. Springer, 2009.
  30. Fixed points, nash equilibria, and the existential theory of the reals. Theory of Computing Systems, 60(2):172–193, 2017.
  31. Beyond the existential theory of the reals. CoRR, abs/2210.00571, 2022. doi:10.48550/ARXIV.2210.00571. URL https://doi.org/10.48550/arXiv.2210.00571.
  32. Separating nondeterministic time complexity classes. Journal of the ACM (JACM), 25(1):146–167, 1978.
  33. Complete identification methods for the causal hierarchy. Journal of Machine Learning Research, 9(Sep):1941–1979, 2008.
  34. The hardness of reasoning about probabilities and causality. In Proc. Joint Conference on Artificial Intelligence (IJCAI 2023), 2023.
  35. Stanislav Žák. A Turing machine time hierarchy. Theoretical Computer Science, 26(3):327–333, 1983.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets