scientific article; zbMATH DE number 6850426

zbMath1403.68074MaRDI QIDQ4608006

Joshua Brakensiek, Venkatesan Guruswami

Publication date: 15 March 2018

Full work available at URL: http://dl.acm.org/citation.cfm?id=3175422

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (18)

The lattice and semigroup structure of multipermutations ⋮ Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy ⋮ Unnamed Item ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs ⋮ Constraint satisfaction problem: what makes the problem easy ⋮ $(2+\varepsilon)$-Sat Is NP-hard ⋮ Closed sets of finitary functions between finite fields of coprime order ⋮ The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems ⋮ Sandwiches for promise constraint satisfaction ⋮ Reflections and powers of multisorted minions ⋮ On the number of clonoids ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rainbow Coloring Hardness via Low Sensitivity Polymorphisms ⋮ Closed sets of finitary functions between products of finite fields of coprime order ⋮ Nonfinitely based ai-semirings with finitely based semigroup reducts ⋮ Solving CSPs Using Weak Local Consistency ⋮ Rainbow Coloring Hardness via Low Sensitivity Polymorphisms

This page was built for publication: