메뉴 건너뛰기




Volumn 90, Issue 6, 2004, Pages 301-305

A lower bound for testing juntas

Author keywords

Boolean functions; Computational complexity; Property testing; Randomized algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; INFORMATION SCIENCE; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; QUERY LANGUAGES; RANDOM PROCESSES; THEOREM PROVING;

EID: 2442542636     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.01.023     Document Type: Article
Times cited : (61)

References (13)
  • 2
    • 0032614554 scopus 로고    scopus 로고
    • Regular languages are testable with a constant number of queries
    • Alon N., Krivelevich M., Newman I., Szegedy M. Regular languages are testable with a constant number of queries. Proc. 40th FOCS. 1999;645-655.
    • (1999) Proc. 40th FOCS , pp. 645-655
    • Alon, N.1    Krivelevich, M.2    Newman, I.3    Szegedy, M.4
  • 3
    • 0000619172 scopus 로고
    • Self-testing/correcting with applications to numerical problems
    • Blum M., Luby M., Rubinfeld R. Self-testing/correcting with applications to numerical problems. J. Comput. System Sci. 47:1993;549-595.
    • (1993) J. Comput. System Sci. , vol.47 , pp. 549-595
    • Blum, M.1    Luby, M.2    Rubinfeld, R.3
  • 4
    • 2442614730 scopus 로고    scopus 로고
    • Testing acyclicity of directed graphs in sublinear time
    • Bender M.A., Ron D. Testing acyclicity of directed graphs in sublinear time. Proc. 27th ICALP. 2000.
    • (2000) Proc. 27th ICALP
    • Bender, M.A.1    Ron, D.2
  • 7
    • 0032108275 scopus 로고    scopus 로고
    • Property testing and its connection to learning and approximation
    • Goldreich O., Goldwasser S., Ron D. Property testing and its connection to learning and approximation. J. ACM. 45:(4):1998;653-750.
    • (1998) J. ACM , vol.45 , Issue.4 , pp. 653-750
    • Goldreich, O.1    Goldwasser, S.2    Ron, D.3
  • 8
    • 0030694952 scopus 로고    scopus 로고
    • Property testing in bounded degree graphs
    • Goldreich O., Ron D. Property testing in bounded degree graphs. Proc. 25th STOC. 1997;406-415.
    • (1997) Proc. 25th STOC , pp. 406-415
    • Goldreich, O.1    Ron, D.2
  • 9
    • 0040113668 scopus 로고    scopus 로고
    • A sublinear bipartite tester for bounded degree graphs
    • Goldreich O., Ron D. A sublinear bipartite tester for bounded degree graphs. Combinatorica. 19:(3):1999;335-373.
    • (1999) Combinatorica , vol.19 , Issue.3 , pp. 335-373
    • Goldreich, O.1    Ron, D.2
  • 12
    • 0012617745 scopus 로고    scopus 로고
    • Proclaiming dictators and juntas or testing boolean formulae
    • Parnas M., Ron D., Samorodnitsky A. Proclaiming dictators and juntas or testing boolean formulae. Proc. 5th RANDOM. 2001;273-284.
    • (2001) Proc. 5th RANDOM , pp. 273-284
    • Parnas, M.1    Ron, D.2    Samorodnitsky, A.3
  • 13
    • 0030128622 scopus 로고    scopus 로고
    • Robust characterization of polynomials with applications to program testing
    • Rubinfeld R., Sudan M. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25:(2):1996;252-271.
    • (1996) SIAM J. Comput. , vol.25 , Issue.2 , pp. 252-271
    • Rubinfeld, R.1    Sudan, M.2


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