On vanishing sums of roots of unity in polynomial calculus and sum-of-squares

Vista senzilla d'ítem
dc.contributor.authorBonacina, Ilario
dc.contributor.authorGalesi, Nicola
dc.contributor.authorLauria, Massimo
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2022-12-01T12:25:08Z
dc.date.available2022-12-01T12:25:08Z
dc.date.issued2022
dc.description.abstractVanishing 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.
dc.description.peerreviewedPeer Reviewed
dc.description.sponsorshipThe first author was supported by the MICIN grants PID2019-109137GB-C22 and IJC2018-035334-I, and partially by the grant PID2019-109137GB-C21.
dc.description.versionPostprint (published version)
dc.identifier.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.
dc.identifier.doi10.4230/LIPIcs.MFCS.2022.23
dc.identifier.isbn978-3-95977-256-3
dc.identifier.urihttps://hdl.handle.net/2117/377529
dc.language.isoeng
dc.publisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
dc.relation.projectidinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-109137GB-C22/ES/SISTEMAS DE PRUEBA MAS ALLA DE RESOLUCION: ANALISIS TEORICO/
dc.relation.projectidinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-109137GB-C21/ES/SISTEMAS DE DEMOSTRACION PRACTICOS MAS ALLA DE RESOLUCION/
dc.relation.publisherversionhttps://drops.dagstuhl.de/opus/frontdoor.php?source_opus=16821
dc.rights.accessOpen Access
dc.rights.licensenameAttribution 4.0 International
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshPolynomials
dc.subject.lemacPolinomis
dc.subject.otherKnapsack
dc.subject.otherPolynomial calculus
dc.subject.otherRoots of unity
dc.subject.otherSum-of-squares
dc.subject.otherBoolean variables
dc.subject.otherNatural generalization
dc.titleOn vanishing sums of roots of unity in polynomial calculus and sum-of-squares
dc.typeConference report
dspace.entity.typePublication
local.citation.authorBonacina, I.; Galesi, N.; Lauria, M.
local.citation.contributorInternational Symposium on Mathematical Foundations of Computer Science
local.citation.endingPage23:15
local.citation.publicationName47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022: August 22–26, 2022, Vienna, Austria
local.citation.pubplaceWadern
local.citation.startingPage23:1
local.identifier.drac34905809

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Miniatura
Nom:
LIPIcs-MFCS-2022-23.pdf
Mida:
760.32 KB
Format:
Adobe Portable Document Format
Descripció:

Col·leccions

Enviament des de DRAC
Ponències/Comunicacions de congressos
Ponències/Comunicacions de congressos