DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Unique games conjecture
Unique games conjecture
The Strongish Planted Clique Hypothesis and Its Consequences
Approximating Cumulative Pebbling Cost Is Unique Games Hard
A New Point of NP-Hardness for Unique Games
Research Statement
Limits of Approximation Algorithms: Pcps and Unique Games (DIMACS Tutorial Lecture Notes)1
How to Play Unique Games Against a Semi-Random Adversary
Lecture 17: the Strong Exponential Time Hypothesis 1 Introduction 2 ETH, SETH, and the Sparsification Lemma
Lecture 24: Hardness Assumptions 1 Overview 2 NP-Hardness 3 Learning Parity with Noise
Counterexamples to the Low-Degree Conjecture Justin Holmgren NTT Research, Palo Alto, CA, USA
[email protected]
Alexander S
Inapproximability of Maximum Biclique Problems, Minimum $ K $-Cut And
Current Events Bulletin
On the Mysteries of MAX NAE-SAT
On the Unique Games Conjecture
Cryptographic Assumptions: a Position Paper
Lower Bounds on the Size of Semidefinite Relaxations
Truth Vs. Proof in Computational Complexity
A Periodic Isoperimetric Problem Related to the Unique Games Conjecture
Small-Set Expansion in Shortcode Graph and the 2-To-2 Conjecture
Top View
Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
Approximation Algorithms and Max-Cut
An Exposition of Dinur-Khot-Kindler-Minzer-Safra's
Graph Expansion and the Unique Games Conjecture
UC Berkeley UC Berkeley Electronic Theses and Dissertations
Counterexamples to the Low-Degree Conjecture
The Unique Games and Sum of Squares: a Love Hate Relation- Ship
Lecture 24: Hardness Assumptions 1 Overview 2 NP-Hardness 3
Approximating Cumulative Pebbling Cost Is Unique Games Hard
Approximate Hypergraph Coloring Under Low-Discrepancy and Related Promises
On the Proof of the 2-To-2 Games Conjecture
The Projection Games Conjecture and the NP-Hardness of Ln N-Approximating Set-Cover
Near-Optimal Algorithms for Unique Games
Approaches to Prove the Unique Games Conjecture Subexponential
The Unique Games Conjecture and Some of Its Implications on Inapproximability
Lecture 22 1 the Unique Games Conjecture
Approximation Algorithms and Max-Cut Topics in Mathematics of Data Science (Fall 2015)
Almost-Polynomial Ratio ETH-Hardness of Approximating