메뉴 건너뛰기




Volumn 182, Issue 1, 1999, Pages 105-142

Clique is hard to approximate within n1-ε

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000109157     PISSN: 00015962     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02392825     Document Type: Article
Times cited : (829)

References (34)
  • 2
    • 0031651077 scopus 로고    scopus 로고
    • Probabilistic checking of proofs: A new characterization of NP
    • ARORA, S. & SAFRA, S., Probabilistic checking of proofs: a new characterization of NP. J. ACM, 45 (1998), 70-122.
    • (1998) J. ACM , vol.45 , pp. 70-122
    • Arora, S.1    Safra, S.2
  • 5
    • 0002771903 scopus 로고
    • Nondeterministic exponential time has two-prover interactive protocols
    • BABAI, L., FORTNOW, L. & LUND, C., Nondeterministic exponential time has two-prover interactive protocols. Comput. Complexity, 1 (1991), 3-40.
    • (1991) Comput. Complexity , vol.1 , pp. 3-40
    • Babai, L.1    Fortnow, L.2    Lund, C.3
  • 7
    • 0542423500 scopus 로고    scopus 로고
    • Free bits, PCP's and nonapproximability - Towards tight results
    • BELLARE, M., GOLDREICH, O. & SUDAN, M., Free bits, PCl's and nonapproximability-towards tight results. SIAM J. Comput., 27 (1998), 804-915.
    • (1998) SIAM J. Comput. , vol.27 , pp. 804-915
    • Bellare, M.1    Goldreich, O.2    Sudan, M.3
  • 11
    • 0026624588 scopus 로고
    • On the complexity of approximating the independent set problem
    • BERMAN, P. & SCHNITGER, G., On the complexity of approximating the independent set problem. Inform, and Comput., 96 (1992), 77-94.
    • (1992) Inform, and Comput. , vol.96 , pp. 77-94
    • Berman, P.1    Schnitger, G.2
  • 12
    • 0001159084 scopus 로고
    • Approximating maximum independent sets by excluding subgraphs
    • BOPPANA, R. & HALLDÓRSSON, M., Approximating maximum independent sets by excluding subgraphs. BIT, 32 (1992), 180-196.
    • (1992) BIT , vol.32 , pp. 180-196
    • Boppana, R.1    Halldórsson, M.2
  • 13
    • 0039615765 scopus 로고
    • p-product spaces
    • École Polytechnique, Palaiseau, 1980
    • p-product spaces, in Seminaire d'analyse fonctionnelle (1979 1980), pp. 4.1-4.9. École Polytechnique, Palaiseau, 1980.
    • (1979) Seminaire d'Analyse Fonctionnelle , pp. 41-49
    • Bourgain, J.1
  • 15
    • 0029703219 scopus 로고    scopus 로고
    • A threshold of inn for approximating set cover
    • Philadelphia, PA, To appear in J. ACM
    • FEIGE, U., A threshold of Inn for approximating set cover, in 28th Annual ACM Symposium on Theory of Computing (Philadelphia, PA, 1996), pp. 314-318. To appear in J. ACM.
    • (1996) 28th Annual ACM Symposium on Theory of Computing , pp. 314-318
    • Feige, U.1
  • 16
    • 85027123851 scopus 로고
    • Approximating the value of two-prover proof systems, with applications to MAX 2SAt and MAX DICUT
    • Tel Aviv. IEEE Comput. Soc. Press, Los Alamitos, CA, 1995
    • FEIGE, U. & GOEMANS, M., Approximating the value of two-prover proof systems, with applications to MAX 2SAT and MAX DICUT, in 3rd Israel Symposium on the Theory of Computing and Systems (Tel Aviv, 1995), pp. 182-189. IEEE Comput. Soc. Press, Los Alamitos, CA, 1995.
    • (1995) 3rd Israel Symposium on the Theory of Computing and Systems , pp. 182-189
    • Feige, U.1    Goemans, M.2
  • 17
    • 0030100766 scopus 로고    scopus 로고
    • Interactive proofs and the hardness of approximating cliques
    • FEIGE, U., GOLDWASSER, S., LOVÁsz, L., SAFRA, S. & SZEGEDY, M., Interactive proofs and the hardness of approximating cliques. J. ACM, 43 (1996), 268-292.
    • (1996) J. ACM , vol.43 , pp. 268-292
    • Feige, U.1    Goldwasser, S.2    Lovász, L.3    Safra, S.4    Szegedy, M.5
  • 19
    • 0029716128 scopus 로고    scopus 로고
    • Zero-knowledge and the chromatic number
    • Philadelphia, PA
    • -Zero-knowledge and the chromatic number, in 11th Annual IEEE Conference on Computational Complexity (Philadelphia, PA, 1996), pp. 278-287.
    • (1996) 11th Annual IEEE Conference on Computational Complexity , pp. 278-287
  • 23
    • 0024611659 scopus 로고
    • The knowledge complexity of interactive proof systems
    • GOLDWASSER, S., MICALI, S. & RACKOFF, C., The knowledge complexity of interactive proof systems. SIAM J. Comput., 18 (1989), 186-208.
    • (1989) SIAM J. Comput. , vol.18 , pp. 186-208
    • Goldwasser, S.1    Micali, S.2    Rackoff, C.3
  • 24
    • 0029712043 scopus 로고    scopus 로고
    • Testing of the long code and hardness for clique
    • Philadelphia, PA. ACM, New York, 1996
    • HÅSTAD J., Testing of the long code and hardness for clique, in 28th Annual ACM Symposium on Theory of Computing (Philadelphia, PA, 1996), pp. 11-19. ACM, New York, 1996.
    • (1996) 28th Annual ACM Symposium on Theory of Computing , pp. 11-19
    • Håstad, J.1
  • 25
    • 0030386107 scopus 로고    scopus 로고
    • 1-ε
    • Burlington, VT. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996
    • 1-ε, in 37th Annual IEEE Symposium on Foundations of Computer Science (Burlington, VT, 1996), pp. 627-636. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.
    • (1996) 37th Annual IEEE Symposium on Foundations of Computer Science , pp. 627-636
  • 27
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • JOHNSON, D. S., Approximation algorithms for combinatorial problems. J. Comput. System Sci., 9 (1974), 256-278.
    • (1974) J. Comput. System Sci. , vol.9 , pp. 256-278
    • Johnson, D.S.1
  • 28
    • 0026930922 scopus 로고
    • Algebraic methods for interactive proof systems
    • LUND, C., FORTNOW, L., KARLOFF, H. & NISAN, N., Algebraic methods for interactive proof systems. J. ACM, 39 (1992), 859-868.
    • (1992) J. ACM , vol.39 , pp. 859-868
    • Lund, C.1    Fortnow, L.2    Karloff, H.3    Nisan, N.4
  • 31
    • 0026366408 scopus 로고
    • Optimization, approximation and complexity classes
    • PAPADIMITRIOU, C. & YANNAKAKIS, M., Optimization, approximation and complexity classes. J. Comput. System Sci., 43 (1991), 425-440.
    • (1991) J. Comput. System Sci. , vol.43 , pp. 425-440
    • Papadimitriou, C.1    Yannakakis, M.2
  • 32
    • 0001226672 scopus 로고    scopus 로고
    • A parallel repetition theorem
    • RAZ, R., A parallel repetition theorem. SIAM J. Comput., 27 (1998), 763-803.
    • (1998) SIAM J. Comput. , vol.27 , pp. 763-803
    • Raz, R.1
  • 33
    • 0026930543 scopus 로고
    • IP=PSPACE
    • SHAMIR, A., IP=PSPACE. J. ACM, 39 (1992), 869-877.
    • (1992) J. ACM , vol.39 , pp. 869-877
    • Shamir, A.1
  • 34
    • 0001327627 scopus 로고    scopus 로고
    • On unapproximable versions of NP-complete problems
    • ZUCKERMAN, D., On unapproximable versions of NP-complete problems. SIAM J. Comput., 25 (1996), 1293-1304.
    • (1996) SIAM J. Comput. , vol.25 , pp. 1293-1304
    • Zuckerman, D.1


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