메뉴 건너뛰기
Computational Complexity
Volumn 5, Issue 1, 1995, Pages 60-75
Derandomized graph products
Author keywords

Approximation; derandomization; random walks; Subject classifications: 60J15, 68R10
Indexed keywords

EID: 0002566799     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/BF01277956     Document Type: Article
Times cited : (106)
References (25)
  • 1
    • 84934410816 scopus 로고    scopus 로고
    • M. Ajtai, J. Komlós, and E. Szemerédi, Deterministic Simulation in Logspace. Proc. Nineteenth Ann. ACM Symp. Theor. Comput., 1987, 132–140.
  • 4
    • 84934410815 scopus 로고    scopus 로고
    • E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoret. Comput. Sci., to appear.
  • 5
    • 84934410818 scopus 로고    scopus 로고
    • S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The Hardness of Approximate Optima in Lattices, Codes and Linear Equations. Proc. 34th Ann. IEEE Symp. Found. Comput. Sci., 1993, 724–733. (Final version submitted to J. Comput. System Sci.)
  • 6
    • 84934410817 scopus 로고    scopus 로고
    • S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems. Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 14–23.
  • 7
    • 84934410812 scopus 로고    scopus 로고
    • S. Arora and S. Safra, Probabilistic Checking of Proofs; A New Characterization of NP. Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 2–13.
  • 8
    • 84934410811 scopus 로고    scopus 로고
    • M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proofs. Proc. 31st Ann. IEEE Symp. Found. Comput. Sci., 1990, 563–572.
  • 9
    • 84934410814 scopus 로고    scopus 로고
    • P. Berman and M. Furer, Approximating maximum independent set in bounded degree graphs. Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, 365–371.
  • 11
    • 84934410813 scopus 로고    scopus 로고
    • A. Blum. Ph.D. dissertation, MIT.
  • 12
    • 84934410810 scopus 로고    scopus 로고
    • A. Cohen and A. Wigderson, Dispersers, deterministic amplification, and weak random sources. Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 14–19.
  • 13
    • 84934410769 scopus 로고    scopus 로고
    • U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating Clique is Almost NP-complete. Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci., 1991, 2–12.
  • 16
    • 84934410770 scopus 로고    scopus 로고
    • M. Halldorsson and J. Radhakrishnan, Greed is good: approximating independent sets in sparse and bounded-degree graphs. Proc. Twenty-sixth Ann. ACM Symp. Theor. Comput., 1994, 439–448.
  • 17
    • 84934410773 scopus 로고    scopus 로고
    • R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits. Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 248–253.
  • 18
    • 84934410774 scopus 로고    scopus 로고
    • N. Kahale, Better Expansion for Ramanujan Graphs. Proc. 33rd Ann. IEEE Symp. Found. Comput. Sci., 1992, 398–404.
  • 19
    • 84934410771 scopus 로고    scopus 로고
    • R. M. Karp, Reducibility Among Combinatorial Problems. In Complexity of Computer Computations, ed. R. Miller and J. Thatcher. Plenum Press, 1972, 85–103.
  • 20
    • 84934410772 scopus 로고    scopus 로고
    • N. Linial and U. Vazirani, Graph Products and Chromatic Numbers. Proc. 30th Ann. IEEE Symp. Found. Comput. Sci., 1989, 124–128.
  • 22
    • 0024045909 scopus 로고
    • Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators
    • (in Russian). English translation in Problems of Information Transmission 24 (1988), 39–46
    • (1988) Problemy Peredachi Informatsii , vol.24 , pp. 51-60
    • Margulis, G.A.1
  • 25
    • 84934410777 scopus 로고    scopus 로고
    • D. Zuckerman, Simulating BPP Using a General Weak Random Source. Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci. 1991, 79–89.

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