On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
From MaRDI portal
Publication:6184293
DOI10.1007/S00037-023-00242-ZOpenAlexW4388605079MaRDI QIDQ6184293FDOQ6184293
Authors: Ilario Bonacina, Nicola Galesi, Massimo Lauria
Publication date: 24 January 2024
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-023-00242-z
Cites Work
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Title not available (Why is that?)
- Semidefinite programming relaxations for semialgebraic problems
- On vanishing sums of roots of unity.
- Symmetric non-negative forms and sums of squares
- Trigonometric diophantine equations (On vanishing sums of roots of unity)
- Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases
- GRASP: a search algorithm for propositional satisfiability
- Title not available (Why is that?)
- Sums of squares on the hypercube
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- Lower bounds for the polynomial calculus and the Gröbner basis algorithm
- Linear gaps between degrees for the polynomial calculus modulo distinct primes
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- Algebraic proof systems over formulas.
- CSP gaps and reductions in the lasserre hierarchy
- Optimality of size-degree tradeoffs for polynomial calculus
- Sums of roots of unity vanishing modulo a prime
- Nullstellensatz-proofs for multiplier verification
- Complexity of Positivstellensatz proofs for the knapsack
- On sums of roots of unity
- On the sum-of-squares degree of symmetric quadratic functions
- Title not available (Why is that?)
- Circuit complexity, proof complexity, and polynomial identity testing. The ideal proof system
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
- The surprising power of constant depth algebraic proofs
- Graph colouring is hard for algorithms based on Hilbert's Nullstellensatz and Gröbner bases
- Proof complexity meets algebra
- Sum of squares bounds for the ordering principle
- Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?
- (Semi)Algebraic proofs over {±1} variables
- The power of negative reasoning
This page was built for publication: On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184293)