Probabilistically Checkable Proofs and the Testing of Hadamard-like Codes

Probabilistically Checkable Proofs and the Testing of Hadamard-like Codes (1996)

Cached

Download Links

[www.dim.uchile.cl]

by Marcos Kiwi

Citations:

15 - 3 self

BibTeX

@MISC{Kiwi96probabilisticallycheckable,
    author = {Marcos Kiwi},
    title = {Probabilistically Checkable Proofs and the Testing of Hadamard-like Codes},
    year = {1996}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
3377	Introduction to Automata Theory, Languages, and Computation - Hopcroft, Motwani, et al. - 2003
1950	Computational complexity - Papadimitriou - 1994
1605	The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1978
1232	Theory of Linear and Integer Programming - SCHRIJVER - 1986
1117	Reducability Among Combinatorial Problems - Karp - 1972
893	The knowledge complexity of interactive proof systems - Goldwasser, Micali, et al. - 1989
636	The complexity of theorem-proving procedures - Cook - 1971
356	Nondeterministic exponential time has two-prover interactive protocols - Babai, Fortnow, et al. - 1990
297	R.: Self-Testing/Correcting with Application to Numerical Problems - Blum, Luby, et al. - 1990
280	Designing programs that check their work - Blum, Kannan - 1995
268	Algebraic methods for interactive proof systems - Lund, Fortnow, et al. - 1990
247	A parallel repetition theorem - Raz - 1998
236	The polynomial-time hierarchy - Stockmeyer - 1977
228	Error-Correcting Codes - Peterson - 1961
221	Szegedy M. Checking computations in polylogarithmic time - Babai, Fortnow, et al. - 1991
164	The NP-completeness column: an ongoing guide - Johnson - 1982
161	Efficient probabilistically checkable proofs and applications to approximations - Bellare, Goldwasser, et al. - 1993
160	Structural Complexity - Balcazar, Diaz, et al. - 1988
121	Multi-prover interactive proofs: how to remove intractability assumptions - Ben-Or, Goldwasser, et al. - 1988
116	On the power of multi-prover interactive protocols - Fortnow, Rompel, et al. - 1994
110	Improved non-approximability results - Bellare, Sudan - 1994
85	Two-prover one-round proof systems: their power and their problems - Feige, Lovász - 1992
75	Self-Testing/Correcting for Polynomials and for Approximate Functions - Gemmell, Lipton, et al. - 1991
69	Nearly-linear size holographic proofs - Polishchuk, Spielman - 1994
64	E cient checking of polynomials and proofs and the hardness of approximation problems - Sudan - 1992
45	KILIAN.llvo proverprotocols - Low error at affordable rates.ACM STOC - FEIGE, J - 1994
42	Symmetric alternation captures BPP - Russell, Sundaram - 1998
39	Some improvements to total degree tests - Friedl, Sudan - 1995
39	A mathematical theory of self-checking, self-testing and selfcorrecting programs - Rubinfeld - 1990
37	PSPACE - IP - 1990
35	Fully parallelized multi prover protocols for NEXP-time - Lapidot, Shamir - 1991
33	Testing of the long code and hardness for clique - H˚astad - 1996
33	Multiple-person alternation - Reif - 1979
29	Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (extended abstract - Condon, Feigenbaum, et al. - 1993
28	Leeuwen (editor), Handbook of Theoretical Computer Science, volume - van - 1990
27	Computational Models of Games - Condon - 1989
26	Program result-checking: A theory of testing meets a test of theory - Blum, Wasserman - 1994
20	Low-degree tests - Friedl, Hatsagi, et al. - 1994
20	Universal games of incomplete information - Reif - 1979
19	Robust Characterizations of Polynomials and their Applications to Program Testing - Rubinfeld, Sudan - 1993
16	Transparent proofs and limits to approximations - Babai - 1994
14	Introduction to coding theory, volume 86 of Graduate Texts in Mathematics - Lint - 1991
12	Free bits and non-approximability - Bellare, Goldreich, et al. - 1995
6	Orthogonal Polynomials, volume 23 of Colloquium Publications - Szegö - 1939
5	Probabilistic proof systems (A survey - Goldreich - 1994
3	Linearity testing in chacaracteristic two - Bellare, Coppersmith, et al. - 1995
3	The noisy oracle model - Feige, Shamir, et al. - 1987
3	Universal’nyĭe perebornyĭe zadachi - Levin - 1973
2	some of this material is - Babai, Moran - 1988