P. Hrubeš
Abstract
For a Boolean function f: {0, 1}n → {0, 1}, let fˆ be the unique multilinear polynomial such that f(x) = fˆ(x) holds for every x ˆ {0, 1}n. We show that, assuming VP ≠ VNP, there exists a polynomial-time computable f such that fˆ requires superpolynomial arithmetic circuits. In fact, this f can be taken as a monotone 2-CNF, or a product of affine functions.
This holds over any field. To prove the results in characteristic 2, we design new VNP-complete families in this characteristic. This includes the polynomial ECn counting edge covers in a graph and the polynomial mcliquen counting cliques in a graph with deleted perfect matching. They both correspond to polynomial-time decidable problems, a phenomenon previously encountered only in characteristic ≠ 2.
- I. Briquel and P. Koiran. 2009. A dichotomy theorem for polynomial evaluation. In Mathematical Foundations of Computer Science 2009. Lecture Notes in Computer Science, Vol. 5734. Springer, 187--198. Google Scholar
Digital Library
- P. Bürgisser. 2000. Completeness and Reduction in Algebraic Complexity Theory. Algorithms and Computation in Mathematics, Vol. 7. Springer. Google ScholarCross Ref
- P. Bürgisser, M. Clausen, and M. A. Shokrollahi. 1997. Algebraic Complexity Theory. Vol. 315. Springer. Google ScholarCross Ref
- P. Hrubeš and A. Yehudayoff. 2011. Arithmetic complexity in ring extensions. Theory of Computing 7, 119--129. Google ScholarCross Ref
- M. Jerrum. 1981. On the Complexity of Evaluating Multivariate Polynomials. Ph.D. Dissertation. Department of Computer Science, University of Edinburgh.Google Scholar
- A. Juma, V. Kabanets, C. Rackoff, and A. Shpilka. 2009. The black-box query complexity of polynomial summation. Computational Complexity 18, 1, 59--79. Google ScholarDigital Library
- G. Malod. 2007. The complexity of polynomials and their coefficient functions. In Proceedings of the IEEE Conference on Computational Complexity. 193--204. Google ScholarDigital Library
- A. Shpilka and A. Yehudayoff. 2010. Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science 5, 3, 207--388.Google ScholarDigital Library
- V. Strassen. 1973. Vermeidung von divisionen. Journal fur die reine angewandte Mathematik 264, 182--202.Google Scholar
- L. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. 1983. Fast parallel computation of polynomials using few processors. SIAM Journal on Computing 12, 641--644. Google ScholarCross Ref
- L. G. Valiant. 1979. Completeness classes in algebra. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing. 249--261. Google ScholarDigital Library
- L. G. Valiant. 2006. Accidental algorithms. In Proceedings of the 47th Annual IEEE Symposium Foundations of Computer Science. 509--517.Google ScholarDigital Library
- A. Wigderson. 1992. The complexity of graph connectivity. In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science. 112--132. Google ScholarCross Ref
Index Terms
- On Hardness of Multilinearization and VNP-Completeness in Characteristic 2
Recommendations
A note on VNP-completeness and border complexity
Highlights- VNP ∖ VNPC lies dense in VNP.
- VNPC lies dense in VNP.
Using nondeterminism to amplify hardness
STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computingWe revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC '02). We prove that if NP has a balanced function f such that any circuit of size s(n) fails to compute f on a 1/poly(n) fraction of inputs, then NP has a ...
Average-case hardness of NP from exponential worst-case hardness assumptions
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingA long-standing and central open question in the theory of average-case complexity is to base average-case hardness of NP on worst-case hardness of NP. A frontier question along this line is to prove that PH is hard on average if UP requires (sub-)...
Comments