Conjectura de jogos únicos (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Conjectura de jogos únicos" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

2^nd place

4^th place

451^st place

981^st place

1simonsfoundation.org

low place

low place

1rjlipton.wordpress.com

low place

low place

low place

low place

332^nd place

526^th place

1weizmann.ac.il

4,983^rd place

low place

1web.archive.org

1^st place

1^st place

741^st place

748^th place

ams.org

Chor, Benny; Sudan, Madhu (1998), «A geometric approach to betweenness», SIAM Journal on Discrete Mathematics, 11 (4): 511–523 (electronic), MR 1640920, doi:10.1137/S0895480195296221 .
Charikar, Moses; Guruswami, Venkatesan; Manokaran, Rajsekar (2009), «Every permutation CSP of arity 3 is approximation resistant», 24th Annual IEEE Conference on Computational Complexity, pp. 62–73, MR 2932455, doi:10.1109/CCC.2009.29 .

cornell.edu

cs.cornell.edu

Khot, Subhash; Kindler, Guy; Mossel, Elchanan; O'Donnell, Ryan (2007), "Optimal inapproximability results for MAX-CUT and other two-variable CSPs?"

doi.org

doi.org

Khot, Subhash (2002), "On the power of unique 2-prover 1-round games", Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 767–775, doi:10.1145/509907.510017, ISBN 1-58113-495-9
Håstad, Johan (1999), "Some Optimal Inapproximability Results", Journal of the ACM, doi:10.1145/502090.502098.
Goemans, Michel X.; Williamson, David P. (1995), "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming", Journal of the ACM, doi:10.1145/227683.227684
Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex cover" (PDF), Annals of Mathematics 162 (1): 439–485, doi:10.4007/annals.2005.162.439, retrieved 2010-03-05.
Karpinski, Marek; Schudy, Warren (2009), "Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems", Proceedings of the forty-first annual ACM symposium on Theory of computing: 313–322, doi:10.1145/1536414.1536458

dx.doi.org

Chor, Benny; Sudan, Madhu (1998), «A geometric approach to betweenness», SIAM Journal on Discrete Mathematics, 11 (4): 511–523 (electronic), MR 1640920, doi:10.1137/S0895480195296221 .
Charikar, Moses; Guruswami, Venkatesan; Manokaran, Rajsekar (2009), «Every permutation CSP of arity 3 is approximation resistant», 24th Annual IEEE Conference on Computational Complexity, pp. 62–73, MR 2932455, doi:10.1109/CCC.2009.29 .

kth.se

nada.kth.se

Håstad, Johan (1999), "Some Optimal Inapproximability Results", Journal of the ACM, doi:10.1145/502090.502098.

princeton.edu

cs.princeton.edu

«Subexponential Algorithms for Unique Games and Related Problems» (PDF). Consultado em 9 de julho de 2016. Arquivado do original (PDF) em 5 de setembro de 2012

rjlipton.wordpress.com

Dick Lipton (5 de maio de 2010). «Unique Games: A Three Act Play». Gödel’s Lost Letter and P=NP. Consultado em 29 de outubro de 2012

simonsfoundation.org

Erica Klarreich (6 de outubro de 2011). «Approximately Hard: The Unique Games Conjecture». Simons Foundation. Consultado em 29 de outubro de 2012

web.archive.org

«Subexponential Algorithms for Unique Games and Related Problems» (PDF). Consultado em 9 de julho de 2016. Arquivado do original (PDF) em 5 de setembro de 2012

weizmann.ac.il

wisdom.weizmann.ac.il

Dinur, Irit; Safra, Samuel (2005), "On the hardness of approximating minimum vertex cover" (PDF), Annals of Mathematics 162 (1): 439–485, doi:10.4007/annals.2005.162.439, retrieved 2010-03-05.