메뉴 건너뛰기




Volumn 42, Issue 6 PART 1, 1996, Pages 1781-1795

Linearity testing in characteristic two

Author keywords

Approximation; Error detection; Hadamard codes; Linearity testing; Maxsnp; Probabilistically checkable proofs; Program testing

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); ERROR DETECTION; FOURIER TRANSFORMS; FUNCTIONS; PROBABILITY;

EID: 0030289082     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556674     Document Type: Article
Times cited : (134)

References (20)
  • 12
    • 0028255086 scopus 로고    scopus 로고
    • in Proc. 5th ACM-S1AM Annu. Symp. on Discrete Algorithms, 1994.
    • K. Friedl, Zs. Hâtsâgi, and A. Shen, Low-degree testing, in Proc. 5th ACM-S1AM Annu. Symp. on Discrete Algorithms, 1994.
    • Low-degree Testing
    • Friedl, K.1    Hâtsâgi, Z.2    Shen, A.3
  • 14
    • 33747155860 scopus 로고    scopus 로고
    • Self-testing/correcting for polynomials and for approximate functions, in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
    • P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, Self-testing/correcting for polynomials and for approximate functions, in Proc. 23rd ACM Annu. Symp. on Theory of Computing, 1991.
    • Gemmell, P.1    Lipton, R.2    Rubinfeld, R.3    Sudan, M.4    Wigderson, A.5
  • 17
    • 33747157161 scopus 로고    scopus 로고
    • private communication, Oct. 1995.
    • D. J. Kleitman, private communication, Oct. 1995.
    • Kleitman, D.J.1


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