Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PROBABILISTICALLY CHECKABLE PROOFS:
Reports tagged with probabilistically checkable proofs:
TR97-010 | 2nd April 1997
Marcos Kiwi

Testing and Weight Distributions of Dual Codes


We study the testing problem, that is, the problem of determining (maybe
probabilistically) if a function to which we have oracle access
satisfies a given property.

We propose a framework in which to formulate and carry out the analyzes
of several known tests. This framework establishes a connection between
more >>>




ISSN 1433-8092 | Imprint