scientific article; zbMATH DE number 7559384

DOI10.4230/LIPIcs.MFCS.2020.13MaRDI QIDQ5089174

Arpitha P. Bharathi, Monaldo Mastrolilli

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

constraint satisfaction problemspolymorphismsGröbner basis theorypolynomial ideal membership

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism

Cites Work

• Unnamed Item
• Unnamed Item
• On the algebraic structure of combinatorial problems
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
• Recent Results on Polynomial Identity Testing
• Theta Bodies for Polynomial Ideals
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• On the Shannon capacity of a graph
• Closure properties of constraints
• Complexity of Membership Problems of Different Types of Polynomial Ideals
• SOS Is Not Obviously Automatizable, Even Approximately
• Membership in polynomial ideals over Q is exponential space complete
• On the Bit Complexity of Sum-of-Squares Proofs
• The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
• Ideals, Varieties, and Algorithms
• The complexity of satisfiability problems

This page was built for publication: