scientific article; zbMATH DE number 7724189

DOI10.4230/LIPICS.MFCS.2021.16MaRDI QIDQ6168426zbMATH OpenFDO

Authors Arpitha P. Bharathi, Monaldo Mastrolilli

Publication date 8 August 2023

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2021.16

zbMATH Keywords

constraint satisfaction problemsGröbner basis theorypolymorphismspolynomial ideal membership

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The complexity of the ideal membership problem for constrained problems over the Boolean domain
• The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
• scientific article; zbMATH DE number 16646
• scientific article; zbMATH DE number 7559384
• Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
• The ideal membership problem and polynomial identity testing
• On the complexity of CSP-based ideal membership problems
• The Minimization Problem for Boolean Formulas
• Optimal and suboptimal algorithms in set membership identification
• On computing minimal and perfect model membership

Cited in

(6)

• The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
• scientific article; zbMATH DE number 7559384 (Why is no real title available?)
• Computational complexity of sum-of-squares bounds for copositive programs
• Ideal membership problem for Boolean minority and dual discriminator
• The ideal membership problem and abelian groups
• On the degree automatability of sum-of-squares proofs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168426)