메뉴 건너뛰기




Volumn 1, Issue 2, 2009, Pages 101-111

Economical toric spines via Cheeger's inequality

Author keywords

Cheeger's inequality; parallel repetition; torus

Indexed keywords


EID: 77955239307     PISSN: 17935253     EISSN: 17937167     Source Type: Journal    
DOI: 10.1142/S1793525309000096     Document Type: Article
Times cited : (22)

References (10)
  • 1
    • 51249173340 scopus 로고
    • Eigenvalues and expanders
    • N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986) 83-96.
    • (1986) Combinatorica , vol.6 , pp. 83-96
    • Alon, N.1
  • 2
    • 84857610746 scopus 로고    scopus 로고
    • An elementary construction of constant-degree expanders
    • Also at Combinatorics, Probability and Computing, to appear
    • N. Alon, O. Schwartz and A. Shapira, An elementary construction of constant-degree expanders, Proc. of the 18th Annual ACM-SIAM SODA (2007), pp. 454-458. Also at Combinatorics, Probability and Computing, to appear.
    • (2007) Proc. of the 18th Annual ACM-SIAM SODA , pp. 454-458
    • Alon, N.1    Schwartz, O.2    Shapira, A.3
  • 3
    • 40549088874 scopus 로고    scopus 로고
    • Eliminating cycles in the discrete torus
    • DOI 10.1007/s00453-007-9095-5
    • B. Bollobás, G. Kindler, I. Leader and R. O'Donnell, Eliminating cycles in the discrete torus, LATIN 2006: Theoretical Informatics, Lecture Notes in Comput. Sci., 3887 (Springer, 2006), pp. 202-210. Also Algorithmica 50 (2008) 446-454. (Pubitemid 351366971)
    • (2008) Algorithmica (New York) , vol.50 , Issue.4 , pp. 446-454
    • Bollobas, B.1    Kindler, G.2    Leader, I.3    O'Donnell, R.4
  • 6
    • 34848901667 scopus 로고    scopus 로고
    • Understanding parallel repetition requires understanding foams
    • DOI 10.1109/CCC.2007.39, 4262762, Proceedings - Twenty-Second Annual IEEE Conference on Computational Complexity, CCC 2007
    • U. Feige, G. Kindler and R. O'Donnell, Understanding Parallel Repetition Requires Understanding Foams, Proc. of the 22nd Annual IEEE Conference on Computational Complexity (IEEE, 2007), pp. 179-192. (Pubitemid 47489750)
    • (2007) Proceedings of the Annual IEEE Conference on Computational Complexity , pp. 179-192
    • Feige, U.1    Kindler, G.2    O'Donnell, R.3
  • 9
    • 58049126989 scopus 로고    scopus 로고
    • A counterexample to Strong Parallel repetition
    • R. Raz, A counterexample to Strong Parallel repetition, Proc. FOCS (2008), pp. 369- 373.
    • (2008) Proc. FOCS , pp. 369-373
    • Raz, R.1
  • 10
    • 6344244636 scopus 로고    scopus 로고
    • A lower bound on the integrality gap for minimum multicut in directed networks
    • M. Saks, A. Samorodnitsky and L. Zosin, A lower bound on the integrality gap for minimum multicut in directed networks, Combinatroica 24 (2004) 525-530. (Pubitemid 39392754)
    • (2004) Combinatorica , vol.24 , Issue.3 , pp. 525-530
    • Saks, M.1    Samorodnitsky, A.2    Zosin, L.3


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