메뉴 건너뛰기




Volumn , Issue , 2004, Pages 155-164

Assignment testers: Towards a combinatorial proof of the PCP-theorem

Author keywords

[No Author keywords available]

Indexed keywords

BLACK-BOX TESTER; COMBINATORIAL PROOF; GENERIC TRANSFORMATIONS; WEAK ASSIGNMENT;

EID: 17744364546     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (47)

References (20)
  • 1
    • 0032058198 scopus 로고    scopus 로고
    • Proof verification and the hardness of approximation problems
    • May
    • S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. JACM, 45(3):501-555, May 1998.
    • (1998) JACM , vol.45 , Issue.3 , pp. 501-555
    • Arora, S.1    Lund, C.2    Motwani, R.3    Sudan, M.4    Szegedy, M.5
  • 2
    • 0031651077 scopus 로고    scopus 로고
    • Probabilistic checking of proofs: A new characterization of NP
    • Jan.
    • S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. JACM, 45(1):70-122, Jan. 1998.
    • (1998) JACM , vol.45 , Issue.1 , pp. 70-122
    • Arora, S.1    Safra, S.2
  • 3
    • 0021980820 scopus 로고
    • Trading group theory for randomness
    • L. Babai. Trading group theory for randomness. In STOC '85, pages 421-429, 1985.
    • (1985) STOC '85 , pp. 421-429
    • Babai, L.1
  • 5
    • 0002771903 scopus 로고
    • Non-deterministic exponential time has two-prover interactive protocols
    • L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3-40, 1991.
    • (1991) Computational Complexity , vol.1 , pp. 3-40
    • Babai, L.1    Fortnow, L.2    Lund, C.3
  • 6
    • 0542423500 scopus 로고    scopus 로고
    • Free bits, PCPs, and nonapproximability - Towards tight results
    • June
    • M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and nonapproximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, June 1998.
    • (1998) SIAM Journal on Computing , vol.27 , Issue.3 , pp. 804-915
    • Bellare, M.1    Goldreich, O.2    Sudan, M.3
  • 8
    • 0036041924 scopus 로고    scopus 로고
    • Randomness conductors and constant-degree lossless expanders
    • M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In STOC '02, pages 659-668, 2002.
    • (2002) STOC '02 , pp. 659-668
    • Capalbo, M.1    Reingold, O.2    Vadhan, S.3    Wigderson, A.4
  • 11
    • 17744375224 scopus 로고    scopus 로고
    • A combinatorial consistency lemma with application to proving the PCP theorem
    • LNCS
    • O. Goldreich and S. Safra. A combinatorial consistency lemma with application to proving the PCP theorem. In RANDOM. LNCS, 1997.
    • (1997) RANDOM
    • Goldreich, O.1    Safra, S.2
  • 12
    • 0032108275 scopus 로고    scopus 로고
    • Property testing and its connection to learning and approximation
    • O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998.
    • (1998) Journal of the ACM , vol.45 , Issue.4 , pp. 653-750
    • Goldreich, O.1    Goldwasser, S.2    Ron, D.3
  • 14
    • 0026930922 scopus 로고
    • Algebraic methods for interactive proof systems
    • October
    • C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic methods for interactive proof systems. Journal of the ACM, 39(4):859-868, October 1992.
    • (1992) Journal of the ACM , vol.39 , Issue.4 , pp. 859-868
    • Lund, C.1    Fortnow, L.2    Karloff, H.3    Nisan, N.4
  • 15
    • 0027929411 scopus 로고
    • Nearly linear size holographic proofs
    • A. Polishchuk and D. Spielman. Nearly linear size holographic proofs. In STOC '04, 1994.
    • (1994) STOC '04
    • Polishchuk, A.1    Spielman, D.2
  • 16
    • 0001226672 scopus 로고    scopus 로고
    • A parallel repetition theorem
    • June
    • R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998.
    • (1998) SIAM Journal on Computing , vol.27 , Issue.3 , pp. 763-803
    • Raz, R.1
  • 17
    • 0034503724 scopus 로고    scopus 로고
    • Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
    • O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In FOCS '00, pages 3-13, 2000.
    • (2000) FOCS '00 , pp. 3-13
    • Reingold, O.1    Vadhan, S.2    Wigderson, A.3
  • 18
    • 0030128622 scopus 로고    scopus 로고
    • Robust characterizations of polynomials with applications to program testing
    • R. Rubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal of Computing, 25(2):252-271, 1996.
    • (1996) SIAM Journal of Computing , vol.25 , Issue.2 , pp. 252-271
    • Rubinfeld, R.1    Sudan, M.2
  • 19
    • 0026930543 scopus 로고
    • IP = PSPACE
    • A. Shamir. IP = PSPACE. JACM, 39(4):869-877, 1992.
    • (1992) JACM , vol.39 , Issue.4 , pp. 869-877
    • Shamir, A.1
  • 20
    • 84887462280 scopus 로고    scopus 로고
    • Many-valued logics and holographic proofs
    • M. Szegedy. Many-valued logics and holographic proofs. In ICALP, pages 676-686, 1999.
    • (1999) ICALP , pp. 676-686
    • Szegedy, M.1


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