Robust algorithms with polynomial loss for near-unanimity CSPs

Keyphrases

• Robust Algorithm 100%
• Constraint Satisfaction Problem 100%
• Near Unanimity 100%
• Constraint Language 60%
• Near-unanimity Polymorphism 40%
• Loss Function 20%
• Overlapping Sets 20%
• Constraint Set 20%
• Approximation Algorithms 20%
• Polynomial-time Algorithm 20%
• G(0) 20%
• Log-log 20%
• Algebraic Approach 20%
• Semidefinite Relaxation 20%
• General Bounds 20%
• K Parameter 20%
• Unique Games 20%
• Constraint Relations 20%
• Arity 20%
• Robust Polynomials 20%
• Near Unanimity Operation 20%
• Dual Discriminator 20%
• Doubly Exponential 20%

Computer Science

• Constraint Satisfaction Problems 100%
• Constraint Language 60%
• Approximation Algorithms 20%
• Semidefinite Programming 20%
• Use Case 20%
• Satisfying Assignment 20%
• Constraint Relation 20%
• Satisfied Constraint 20%
• near Unanimity Operation 20%
• polynomial-time algorithm 20%
• Discriminator 20%