메뉴 건너뛰기




Volumn 13, Issue 1, 1998, Pages 1-16

Efficient approximation of product distributions

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0032390523     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199808)13:1<1::AID-RSA1>3.0.CO;2-W     Document Type: Article
Times cited : (63)

References (19)
  • 1
    • 0001011699 scopus 로고
    • A fast and simple randomized parallel algorithm for the maximal independent set problem
    • N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7, 567-583 (1986).
    • (1986) J. Algorithms , vol.7 , pp. 567-583
    • Alon, N.1    Babai, L.2    Itai, A.3
  • 4
    • 85033885375 scopus 로고    scopus 로고
    • Approximating arbitrary probability distributions using small sample spaces
    • to appear
    • Y. Azar, R. Motwani, and J. Naor, Approximating arbitrary probability distributions using small sample spaces, Combinatorica, to appear.
    • Combinatorica
    • Azar, Y.1    Motwani, R.2    Naor, J.3
  • 7
    • 0002739272 scopus 로고
    • On the power of two-point based sampling
    • B. Chor and O. Goldreich, On the power of two-point based sampling, J. Complexity, 5, 96-106 (1989).
    • (1989) J. Complexity , vol.5 , pp. 96-106
    • Chor, B.1    Goldreich, O.2
  • 12
    • 0022146483 scopus 로고
    • A fast parallel algorithm for the maximal independent set problem
    • R. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, J. Assoc. Comput. Mech., 32, 762-773 (1985).
    • (1985) J. Assoc. Comput. Mech. , vol.32 , pp. 762-773
    • Karp, R.1    Wigderson, A.2
  • 13
    • 0002918554 scopus 로고
    • The complexity of non uniform random number generation
    • J. Traub, Ed., AC Press, New York
    • D. Knuth and A. Yao, The complexity of non uniform random number generation, in Algorithms and Complexity, J. Traub, Ed., AC Press, New York, 1976, pp. 357-428.
    • (1976) Algorithms and Complexity , pp. 357-428
    • Knuth, D.1    Yao, A.2
  • 15
    • 85033893606 scopus 로고    scopus 로고
    • Efficient construction of a small hitting set for combinatorial rectangles in high dimension
    • to appear
    • N. Linial, M. Luby, M. Saks, and D. Zuckerman, Efficient construction of a small hitting set for combinatorial rectangles in high dimension, Combinatorica, to appear.
    • Combinatorica
    • Linial, N.1    Luby, M.2    Saks, M.3    Zuckerman, D.4
  • 16
    • 0022807929 scopus 로고
    • A simple parallel algorithm for the maximal independent set problem
    • M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Computing, 15, 1036-1053 (1986).
    • (1986) SIAM J. Computing , vol.15 , pp. 1036-1053
    • Luby, M.1
  • 17
    • 1542710520 scopus 로고    scopus 로고
    • On deterministic approximation of DNF
    • M. Luby and B. Veličković, On deterministic approximation of DNF, Algorithmica, 16, 415-433 (1996).
    • (1996) Algorithmica , vol.16 , pp. 415-433
    • Luby, M.1    Veličković, B.2
  • 18
    • 0027641832 scopus 로고
    • Small-bias probability spaces: Efficient constructions and applications
    • J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, SIAM J. Computing, 22, 838-856 (1993).
    • (1993) SIAM J. Computing , vol.22 , pp. 838-856
    • Naor, J.1    Naor, M.2
  • 19
    • 0000947929 scopus 로고
    • Pseudo-random generators for space-bounded computation
    • N. Nisan, Pseudo-random generators for space-bounded computation, Combinatorica, 12, 449-461 (1992).
    • (1992) Combinatorica , vol.12 , pp. 449-461
    • Nisan, N.1


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