Abstract
The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and division gates, and integer inputs. Input instance: Four lists of positive integers:
a1,..., an∈N+n; b1,...,bn∈N+n; c1,...,cm∈N+m; d1, ..., dm∈N+m;
where each of the integers is represented in binary.
Problem 1 (equality testing): Decide whether a1b1 a2b2⋯anbn=c1d1 c2d2⋯cmdm.
Problem 2 (inequality testing): Decide whether a1b1 a2b2⋯anbn≥c1d1 c2d2⋯cmdm.
Problem 1 is easily decidable in polynomial time using a simple iterative algorithm. Problem 2 is much harder. We observe that the complexity of Problem 2 is intimately connected to deep conjectures and results in number theory. In particular, if a refined form of the ABC conjecture formulated by Baker in 1998 holds, or if the older Lang-Waldschmidt conjecture (formulated in 1978) on linear forms in logarithms holds, then Problem 2 is decidable in P-time (in the standard Turing model of computation). Moreover, it follows from the best available quantitative bounds on linear forms in logarithms, namely, by Baker and Wüstholz [1993] or Matveev [2000], that if m and n are fixed universal constants then Problem 2 is decidable in P-time (without relying on any conjectures). This latter fact was observed earlier by Shub [1993].
We describe one application: P-time maximum probability parsing for arbitrary stochastic context-free grammars (where ε-rules are allowed).
- E. Allender, P. Bürgisser, J. Kjeldgaard-Pedersen, and P. B. Miltersen. 2009. On the complexity of numerical analysis. SIAM J. Comput. 38, 5, 1987--2006. Google Scholar
Digital Library
- E. Bach, J. R. Driscoll, and J. Shallit. 1993. Factor refinement. J. Algor. 15, 2, 199--222. Google Scholar
Digital Library
- A. Baker. 1998. Logarithmic forms and the abc-conjecture. In Number Theory (Eger, 1996), de Gruyter, Berlin, 37--44. Google Scholar
Digital Library
- A. Baker. 2007. On an arithmetical function associated with the abc-conjecture. In Diophantine Geometry, CRM Series, Vol. 4, Ed. Norm., Pisa, 25--33.Google Scholar
- A. Baker and G. Wüstholz. 1993. Logarithmic forms and group varieties. J. Reine Angew. Math. 442, 19--62. Google Scholar
Digital Library
- A. Baker and G. Wüstholz. 2000. Number theory, transcendence and Diophantine geometry in the next millennium. In Mathematics: Frontiers and Perspectives, American Mathematical Society, Providence, RI, 1--12. Google Scholar
Digital Library
- A. Baker and G. Wüstholz. 2007. Logarithmic Forms and Diophantine Geometry. Cambridge University Press.Google Scholar
- D. J. Bernstein. 2005. Factoring into coprimes in essentially linear time. J. Algor. 54, 1, 1--30. Google Scholar
Digital Library
- R. Durbin, S. R. Eddy, A. Krogh, and G. Mitchison. 1999. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press. Google Scholar
Digital Library
- K. Etessami, A. Stewart, and M. Yannakakis. 2012. Polynomial-time algorithms for multi-type branching processes and stochastic context-free grammars. In Proceedings of the 44th ACM Symposium on Theory of Computing (STOC). (Full version on ArXiv:1201.2374). Google Scholar
Digital Library
- M. R. Garey, R. L. Graham, and D. S. Johnson. 1976. Some NP-complete geometric problems. In Proceedings of the 8th ACM Symposium on Theory of Computing (STOC). 10--22. Google Scholar
Digital Library
- A. Granville and T. J. Tucker. 2002. It’s as easy as abc. Notices AMS 49, 10, 1224--1231.Google Scholar
- V. Kabanets and R. Impagliazzo. 2003. Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC). 355--364. Google Scholar
Digital Library
- D. Knuth. 1977. A generalization of Dijkstra’s Algorithm. Inform. Process. Lett. 6, 1--5.Google Scholar
Cross Ref
- S. Lang. 1978. Eliptic Curves: Diophantine Analysis. Springer. Google Scholar
Digital Library
- C. Manning and H. Schütze. 1999. Foundations of Statistical Natural Language Processing. MIT Press. Google Scholar
Digital Library
- D. Masser. 1985. Open problems. In Proceedings of the Symposium on Analytic Number Theory, London Mathematics Society Lecture Notes, Ser. 96, W. W. L. Chen Ed., Cambridge University Press. Google Scholar
Digital Library
- E. M. Matveev. 1998. An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. I. Izv. Ross. Akad. Nauk Ser. Mat. 62, 4, 81--136. (Russian original. English translation in Izvestiya Math. 62, 2, (1998), 723--772.) Google Scholar
Digital Library
- E. M. Matveev. 2000. An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II. Izv. Ross. Akad. Nauk Ser. Mat. 64, 6, 125--180. (Russian original. English translation in Izv. Math. 64, 6, (2000), 1217--1269.) Google Scholar
Digital Library
- M.-J. Nederhof and G. Satta. 2008. Probabilistic parsing. New Devel. Form. Lang. Appl. 113, 229--258.Google Scholar
- Y. Nesterenko. 2003. Linear forms in logarithms of rational numbers. In Diophantine Approximation (Cetraro, 2000), Lecture Notes in Mathematics, vol. 1819, Springer, Berlin, 53--106.Google Scholar
- J. Oesterlè. 1988. Nouvelles approches du “Theoreme” de Fermat. Asterisque 161-2, 165--186.Google Scholar
- A. Schinzel. 2000. Polynomials with Special Regard to Reducibility. Cambridge University Press. Google Scholar
Digital Library
- M. Shub. 1993. Some remarks on Bezout’s theorem and complexity theory. In From Topology to Computation: Proceedings of the Smalefest, M. Hirsch, J. Marsden, and M. Shub Eds., Springer-Verlag, 443--455.Google Scholar
- M. Waldschmidt. 1993. Minorations de combinaisons linéaires de logarithmes de nombres algébriques. Canad. J. Math. 45, 1, 176--224. Google Scholar
Digital Library
- M. Waldschmidt. 2004. Open Diophantine problems. Mosc. Math. J. 4, 1, 245--305, 312.Google Scholar
Cross Ref
Index Terms
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing
Recommendations
Valiant's model and the cost of computing integers
Let ( n ) be the minimum number of arithmetic operations required to build the integer $$n \in \mathbb{N}$$ from the constants 1 and 2. A sequence x n is said to be "easy to compute" if there exists a polynomial p such that $$\tau (x_n ) \leq p(\log n)$$ for all It is natural to conjecture ...
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis: (a) the Blum-Shub-Smale model of computation over the reals; and (b) a problem we call the “generic task of numerical computation,” ...
The complexity of membership problems for circuits over sets of integers
We investigate the complexity of membership problems for {∪, ∩, -, +, ×}-circuits computing sets of integers. These problems are a natural modification of the membership problems for circuits computing sets of natural numbers studied by McKenzie and ...






Comments