Succinct hitting sets and barriers to proving algebraic circuits lower bounds

@article{Forbes2017SuccinctHS,
  title={Succinct hitting sets and barriers to proving algebraic circuits lower bounds},
  author={Michael A. Forbes and Amir Shpilka and Ben lee Volk},
  journal={Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing},
  year={2017}
}
  • Michael A. Forbes, Amir Shpilka, Ben lee Volk
  • Published in STOC 2017
  • Mathematics, Computer Science
  • Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
  • We formalize a framework of algebraically natural lower bounds for algebraic circuits. Just as with the natural proofs notion of Razborov and Rudich for boolean circuit lower bounds, our notion of algebraically natural lower bounds captures nearly all lower bound techniques known. However, unlike the boolean setting, there has been no concrete evidence demonstrating that this is a barrier to obtaining super-polynomial lower bounds for general algebraic circuits, as there is little understanding… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 22 CITATIONS

    Towards an algebraic natural proofs barrier via polynomial identity testing

    VIEW 5 EXCERPTS
    CITES BACKGROUND & RESULTS
    HIGHLY INFLUENCED

    Reconstruction of Full Rank Algebraic Branching Programs

    VIEW 6 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Pseudorandomness and the Minimum Circuit Size Problem

    • Rahul Santhanam
    • Mathematics, Computer Science
    • Electronic Colloquium on Computational Complexity
    • 2019

    Reconstruction of non-degenerate homogeneous depth three circuits

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Average-case linear matrix factorization and reconstruction of low width algebraic branching programs

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES

    Natural proofs versus derandomization

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Deterministic extractors for a ne sources over large elds

    • Ariel Gabizon, Ran Raz
    • Combinatorica 28,
    • 2008
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Towards an algebraic natural proofs barrier via polynomial identity testing

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Unifying Known Lower Bounds via Geometric Complexity Theory

    • Joshua A. Grochow
    • Mathematics, Computer Science
    • 2014 IEEE 29th Conference on Computational Complexity (CCC)
    • 2014
    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Arithmetic natural proofs theory is sought

    • Scott Aaronson, Andrew Drucker
    • 2008
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Lower Bounds and Separations for Constant Depth Multilinear Circuits

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Randomness efficient identity testing of multivariate polynomials

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Probabilistic algorithms for sparse polynomials. In Symbolic and Algebraic Computation, EUROSAM ’79

    • Richard Zippel
    • An International Symposiumon Symbolic and Algebraic Computation (Lecture Notes in Computer Science),
    • 1979
    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    A Probabilistic Remark on Algebraic Program Testing

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL