The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain

DOI10.1137/1.9781611975482.29zbMath1431.68050arXiv1904.04072OpenAlexW3136373374MaRDI QIDQ5236210

Monaldo Mastrolilli

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.04072

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (4)

Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism ⋮ Unnamed Item ⋮ High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts

This page was built for publication: The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain