• DocumentCode
    3243158
  • Title

    Simple analysis of graph tests for linearity and PCP

  • Author

    Håstad, Johan ; Wigderson, Avi

  • Author_Institution
    R. Inst. of Technol., Stockholm, Sweden
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    244
  • Lastpage
    254
  • Abstract
    We give a simple analysis of the PCP (probabilistically Checkable Proof) with low amortized query complexity of Samorodnitsky and Trevisan (2000). The analysis also applied to the linearity testing over finite fields, giving a better estimate of the acceptance probability in terms of the distance of the tested function to the closest linear function
  • Keywords
    computational complexity; graph theory; probability; PCP; Probabilistically Checkable Proof; acceptance probability; finite fields; graph tests; linear function; linearity testing; low amortized query complexity; Boolean functions; Linearity; Performance analysis; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 16th Annual IEEE Conference on, 2001.
  • Conference_Location
    Chicago, IL
  • Print_ISBN
    0-7695-1053-1
  • Type

    conf

  • DOI
    10.1109/CCC.2001.933891
  • Filename
    933891
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3243158