### The hardness of decoding linear codes with preprocessing

暂无分享，去创建一个

[1] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[2] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .

[3] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[4] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..

[5] Jehoshua Bruck,et al. Neural networks, error-correcting codes, and polynomials over the binary n -cube , 1989, IEEE Trans. Inf. Theory.

[6] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[8] Theodore P. Baker,et al. A second step toward the polynomial hierarchy , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[9] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[10] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theoretical Computer Science.

[11] Lev B. Levitin,et al. A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm , 1985, IEEE Trans. Inf. Theory.

[12] S. Louis Hakimi,et al. Cut-set matrices and linear codes (Corresp.) , 1965, IEEE Trans. Inf. Theory.