Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,670,728 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.
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
2015
2015
Information Guides. Popular Culture in the Classroom. Games & Gaming.
E. Erwin
2015
Corpus ID: 152306455
Review
2014
Review
2014
Analyzing Games & Players
J. Dijkstra
2014
Corpus ID: 63772842
This paper gives an overview of techniques developed to analyze both games and players, developed academically and/or…
Expand
2014
2014
Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts
Naman Agarwal
2014
Corpus ID: 123404532
In this thesis we consider two questions motivated by the Unique Games Conjecture . The first question is concerned with the…
Expand
2013
2013
FIU Libraries: research: So You Want to Work in a Library...: Fun & Games
B. Sorondo
2013
Corpus ID: 230255119
2012
2012
Fault-Tolerant Spanners for Doubling Metrics: Better and Simpler
Shay Solomon
arXiv.org
2012
Corpus ID: 15222737
In STOC'95 Arya et al. (1995) conjectured that for any constant dimensional $n$-point Euclidean space, a $(1+\eps)$-spanner with…
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
2004
2004
Games & Geschiedenis: Computerspellen, context en controverse.
J.I.L. Veugen
,
I. Blom
2004
Corpus ID: 141447648