메뉴 건너뛰기
Information Processing Letters
Volumn 59, Issue 3, 1996, Pages 151-157
Sensitivity vs. block sensitivity (an average-case study)
Author keywords

Block sensitivity; Boolean functions; Harmonic analysis; Sensitivity
Indexed keywords

EID: 0010473991     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00105-6     Document Type: Article
Times cited : (14)
References (6)
  • 1
    • 0042006550 scopus 로고
    • Sensitivity of Boolean functions, abstract harmonic analysis and circuit complexity
    • A. Bernasconi and B. Codenotti, Sensitivity of Boolean functions, abstract harmonic analysis and circuit complexity, ICSI Tech. Rept. TR-93-030, 1993.
    • (1993) ICSI Tech. Rept. TR-93-030
    • Bernasconi, A.1    Codenotti, B.2
  • 2
    • 0024864869 scopus 로고
    • CREW PRAMs and decision trees
    • N. Nisan, CREW PRAMs and decision trees, in: Proc. 21st STOC (1989) 327-335.
    • (1989) Proc. 21st STOC , pp. 327-335
    • Nisan, N.1
  • 3
    • 0011181332 scopus 로고
    • Sensitivity vs. block sensitivity of Boolean functions
    • C. Kenyon, Sensitivity vs. block sensitivity of Boolean functions, DIMACS Tech. Rept. 90-18, 1990.
    • (1990) DIMACS Tech. Rept. 90-18
    • Kenyon, C.1
  • 4
    • 0001393530 scopus 로고
    • Sensitivity vs. block sensitivity of Boolean functions
    • D. Rubinstein, Sensitivity vs. block sensitivity of Boolean functions, Combinatorica 15 (2) (1995) 297-299.
    • (1995) Combinatorica , vol.15 , Issue.2 , pp. 297-299
    • Rubinstein, D.1
  • 5
    • 85012890285 scopus 로고
    • A tight Ω(log log n) bound on the time for parallel RAMs to compute nondegenerate Boolean functions
    • FCT'83, Springer, Berlin
    • H.U. Simon, A tight Ω(log log n) bound on the time for parallel RAMs to compute nondegenerate Boolean functions, in: FCT'83, Lecture Notes in Computer Science 158 (Springer, Berlin, 1983).
    • (1983) Lecture Notes in Computer Science , vol.158
    • Simon, H.U.1
  • 6
    • 0004203012 scopus 로고
    • Wiley-Teubner Series in Computer Science (Wiley, New York)
    • I. Wegener, The Complexity of Boolean Functions, Wiley-Teubner Series in Computer Science (Wiley, New York, 1987).
    • (1987) The Complexity of Boolean Functions
    • Wegener, I.1

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