On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
View/Open
Cita com:
hdl:2117/377529
Document typeConference report
Defense date2022
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution 4.0 International
ProjectSISTEMAS DE PRUEBA MAS ALLA DE RESOLUCION: ANALISIS TEORICO (AEI-PID2019-109137GB-C22)
SISTEMAS DE DEMOSTRACION PRACTICOS MAS ALLA DE RESOLUCION (AEI-PID2019-109137GB-C21)
SISTEMAS DE DEMOSTRACION PRACTICOS MAS ALLA DE RESOLUCION (AEI-PID2019-109137GB-C21)
Abstract
Vanishing sums of roots of unity can be seen as a natural generalization of knapsack from Boolean variables to variables taking values over the roots of unity. We show that these sums are hard to prove for polynomial calculus and for sum-of-squares, both in terms of degree and size.
CitationBonacina, I.; Galesi, N.; Lauria, M. On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. A: International Symposium on Mathematical Foundations of Computer Science. "47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022: August 22–26, 2022, Vienna, Austria". Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 23:1-23:15. ISBN 978-3-95977-256-3. DOI 10.4230/LIPIcs.MFCS.2022.23.
ISBN978-3-95977-256-3
Publisher versionhttps://drops.dagstuhl.de/opus/frontdoor.php?source_opus=16821
Files | Description | Size | Format | View |
---|---|---|---|---|
LIPIcs-MFCS-2022-23.pdf | 760,3Kb | View/Open |