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

DOI10.1145/3449350OpenAlexW3203099067WikidataQ130994133 ScholiaQ130994133MaRDI QIDQ5035876

Monaldo Mastrolilli

Publication date: 22 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

Gröbner basisconstraint satisfaction problemssum-of-squarestheta bodiesideal membership problem

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)

On the complexity of CSP-based ideal membership problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Short proofs of ideal membership

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