Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Interpolation in Valiant’s Theory

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult. Answering it negatively would indeed imply that the constant-free versions of the algebraic complexity classes VP and VNP defined by Valiant are different. Answering this question positively would imply a transfer theorem from boolean to algebraic complexity.

Our proof method relies on Lagrange interpolation and on recent results connecting the (boolean) counting hierarchy to algebraic complexity classes. As a by-product, we obtain two additional results:

  1. (i)

    The constant-free, degree-unbounded version of Valiant’s hypothesis VP ≠ VNP implies the degree-bounded version. This result was previously known to hold for fields of positive characteristic only.

  2. (ii)

    If exponential sums of easy to compute polynomials can be computed efficiently, then the same is true of exponential products. We point out an application of this result to the P = NP problem in the Blum–Shub–Smale model of computation over the field of complex numbers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Allender Eric, Bürgisser Peter, Kjeldgaard-Pedersen Johan, Miltersen Peter Bro (2009) On the Complexity of Numerical Analysis. SIAM J. Comput. 38(5): 1987–2006

    Article  MATH  Google Scholar 

  • Lenore Blum, Felipe Cucker, Mike Shub & Steve Smale (1998). Complexity and Real Computation. Springer-Verlag.

  • Blum Lenore, Shub Mike, Smale Steve (1989) 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

    Article  MathSciNet  MATH  Google Scholar 

  • Peter Bürgisser (2000). Completeness and Reduction in Algebraic Complexity Theory. Number 7 in Algorithms and Computation in Mathematics. Springer.

  • Bürgisser Peter (2004) The Complexity of Factors of Multivariate Polynomials. Foundations of Computational Mathematics 4(4): 369–396

    Article  MathSciNet  MATH  Google Scholar 

  • Bürgisser Peter (2009) On Defining Integers And Proving Arithmetic Circuit Lower Bounds. Computational Complexity 18(1): 81–103

    Article  MathSciNet  MATH  Google Scholar 

  • Peter Bürgisser, Michael Clausen & Mohammad Amin Shokrollahi (1997). Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften. Springer.

  • Hervé Fournier & Pascal Koiran (1998). Are Lower Bounds Easier over the Reals? In STOC, 507–513.

  • Hervé Fournier & Pascal Koiran (2000). Lower Bounds Are Not Easier over the Reals: Inside PH. In ICALP, 832–843.

  • Kaltofen Erich, Villard Gilles (2005) On the complexity of computing determinants. Computational Complexity 13(3–4): 91–130

    Article  MathSciNet  Google Scholar 

  • Karp Richard, Lipton Richard (1982) Turing machines that take advice. L’Enseignement Mathématique 28: 191–209

    MathSciNet  MATH  Google Scholar 

  • Koiran Pascal (2005) Valiant’s model and the cost of computing integers. Computational Complexity 13(3–4): 131–146

    Article  MathSciNet  Google Scholar 

  • Pascal Koiran & Sylvain Perifel (2006). Valiant’s Model: From Exponential Sums to Exponential Products. In MFCS, 596–607.

  • Koiran Pascal, Perifel Sylvain (2009) VPSPACE and a transfer theorem over the complex field. Theor. Comput. Sci. 410(50): 5244–5251

    Article  MathSciNet  MATH  Google Scholar 

  • Koiran Pascal, Perifel Sylvain (2009) VPSPACE and a Transfer Theorem over the Reals. Computational Complexity 18(4): 551–575

    Article  MathSciNet  MATH  Google Scholar 

  • Guillaume Malod (2003). Polynômes et coefficients. Ph.D. thesis, Université Claude Bernard Lyon 1. In French, available from http://tel.archives-ouvertes.fr/tel-00087399.

  • Guillaume Malod (2007). The Complexity of Polynomials and Their Coefficient Functions. In IEEE Conference on Computational Complexity, 193–204.

  • Bruno Poizat (1995). Les petits cailloux. Aléas.

  • Mike Shub, Smale Steve (1995) On the intractability of Hilbert’s Nullstellensatz and an algebraic version of “P=NP”. Duke Mathematical Journal 81(1): 47–54

    Article  MathSciNet  Google Scholar 

  • Leslie G. Valiant (1979). Completeness Classes in Algebra. In STOC, 249–261.

  • Wagner Klaus W (1986) The Complexity of Combinatorial Problems with Succinct Input Representation. Acta Inf. 23(3): 325–356

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pascal Koiran.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koiran, P., Perifel, S. Interpolation in Valiant’s Theory. comput. complex. 20, 1–20 (2011). https://doi.org/10.1007/s00037-011-0002-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-011-0002-8

Keywords

Subject classification