메뉴 건너뛰기




Volumn , Issue , 2008, Pages 369-373

A counterexample to strong parallel repetition

Author keywords

[No Author keywords available]

Indexed keywords

NP HARDNESSES; ODD CYCLES; PARALLEL REPETITIONS;

EID: 58049126989     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.49     Document Type: Conference Paper
Times cited : (33)

References (14)
  • 1
    • 43349086069 scopus 로고    scopus 로고
    • Kooshiar Azimian, Mario Szegedy. Parallel Repetition of the Odd Cycle Game. LATIN 2008: 676-686
    • Kooshiar Azimian, Mario Szegedy. Parallel Repetition of the Odd Cycle Game. LATIN 2008: 676-686
  • 6
    • 0036998523 scopus 로고    scopus 로고
    • Error Reduction by Parallel Repetition - A Negative Result
    • preliminary version in CCC
    • Uriel Feige, Oleg Verbitsky: Error Reduction by Parallel Repetition - A Negative Result. Combinatorica 22(4): 461-478 (2002) (preliminary version in CCC 1996)
    • (1996) Combinatorica , vol.22 , Issue.4 , pp. 461-478
    • Uriel Feige, O.V.1
  • 7
    • 35448934885 scopus 로고    scopus 로고
    • Parallel Repetition: Simplifications and the No-Signaling Case
    • Thomas Holenstein. Parallel Repetition: Simplifications and the No-Signaling Case. STOC 2007: 411-419
    • (2007) STOC , pp. 411-419
    • Holenstein, T.1
  • 8
    • 0036040281 scopus 로고    scopus 로고
    • On The Power Of Unique 2-Prover 1-Round Games
    • Subhash Khot. On The Power Of Unique 2-Prover 1-Round Games. STOC 2002: 767-775
    • (2002) STOC , pp. 767-775
    • Khot, S.1
  • 9
    • 40049085242 scopus 로고    scopus 로고
    • Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. SIAM J. Comput. 37(1): 319-357 (2007) (preliminary version in FOCS 2004)
    • Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell. Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. SIAM J. Comput. 37(1): 319-357 (2007) (preliminary version in FOCS 2004)
  • 11
    • 1842545358 scopus 로고    scopus 로고
    • Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields
    • preliminary version in STOC
    • Jon Kleinberg, Eva Tardos. Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. J. ACM 49(5): 616-639 (2002) (preliminary version in STOC 2009)
    • (2002) J. ACM , vol.49 , Issue.5 , pp. 616-639
    • Kleinberg, J.1    Tardos, E.2
  • 12
    • 57049092310 scopus 로고    scopus 로고
    • Parallel Repetition in Projection Games and a Concentration Bound
    • Anup Rao. Parallel Repetition in Projection Games and a Concentration Bound. STOC 2008: 1-10
    • (2008) STOC , pp. 1-10
    • Rao, A.1
  • 13
    • 0001226672 scopus 로고    scopus 로고
    • Ran Raz. A Parallel Repetition Theorem. SIAM J. Comput. 27(3): 763-803 (1998) (preliminary version in STOC 1995)
    • Ran Raz. A Parallel Repetition Theorem. SIAM J. Comput. 27(3): 763-803 (1998) (preliminary version in STOC 1995)
  • 14
    • 57049121341 scopus 로고    scopus 로고
    • On Parallel-Repetition, Unique-Game and Max-Cut
    • Manuscript
    • Muli Safra, Oded Schwartz. On Parallel-Repetition, Unique-Game and Max-Cut. Manuscript 2007
    • (2007)
    • Safra, M.1    Schwartz, O.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.