Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,600,558 papers from all fields of science
Search
Sign In
Create Free Account
Unique games conjecture
Known as:
UGC (disambiguation)
In computational complexity theory, the Unique Games Conjecture is a conjecture made by Subhash Khot in 2002. The conjecture postulates that the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
2-satisfiability
Betweenness
Computational complexity theory
Computational hardness assumption
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem
Niv Buchbinder
,
J. Naor
,
Roy Schwartz
SIAM journal on computing (Print)
2018
Corpus ID: 102484506
The \sf Multiway-Cut problem is a fundamental graph partitioning problem in which the objective is to find a minimum weight set…
Expand
2016
2016
Some consequences of the Firoozbakht's conjecture
L. A. Ferreira
,
H. Mariano
2016
Corpus ID: 119665946
In this paper we present the statement of the Firoozbakht's conjecture, some of its consequences if it is proved and we show a…
Expand
2016
2016
Bounds on 2-query Locally Testable Codes with affine tests
Gillat Kol
,
R. Raz
Information Processing Letters
2016
Corpus ID: 17729983
2015
2015
Information Guides. Popular Culture in the Classroom. Games & Gaming.
E. Erwin
2015
Corpus ID: 152306455
2014
2014
On a connection between small set expansions and modularity clustering
B. Dasgupta
,
Devendra Desai
Information Processing Letters
2014
Corpus ID: 2075794
2014
2014
Strategy machines: representation and complexity of strategies in infinite games
Marcus Gelderie
2014
Corpus ID: 46515748
This thesis studies the representation of winning strategies in infinite games as Turing machines. We show that Turing-machine…
Expand
Review
2010
Review
2010
1 Recap : Unique Games and the Unique Games Conjecture
Prajakta Nimbhorkar
2010
Corpus ID: 55189934
In the last lecture, we proved an inapproximability result for the MAX-CUT problem. We also introduced the unique label cover…
Expand
2009
2009
Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist
Gillat Kol
,
R. Raz
Electron. Colloquium Comput. Complex.
2009
Corpus ID: 18210555
The Unique Games Conjecture (UGC ) is possibly the most important open problem in the research of PCPs and hardness of…
Expand
2006
2006
O ’ Brien Test for Homogeneity of Variance
H. Abdi
2006
Corpus ID: 15525746
The homogeneity of variance assumption is one of the critical assumptions underlying most parametric statistical procedures such…
Expand
Review
1999
Review
1999
Fun, Games & Economics: An appraisal of game theory in economics
J. Lim
1999
Corpus ID: 55038174
Game theory has had a profound influence on many fields of the social sciences since its rise to prominence more than fifty years…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE