Daniel A. Spielman. The Complexity of Error-Correcting Codes. In Bogdan S. Chlebus, Ludwik Czaja, editors, Fundamentals of Computation Theory, 11th International Symposium, FCT 97, Kraków, Poland, September 1-3, 1997, Proceedings. Volume 1279 of Lecture Notes in Computer Science, pages 67-84, Springer, 1997.
@inproceedings{Spielman97,
title = {The Complexity of Error-Correcting Codes},
author = {Daniel A. Spielman},
year = {1997},
researchr = {https://researchr.org/publication/Spielman97},
cites = {0},
citedby = {0},
pages = {67-84},
booktitle = {Fundamentals of Computation Theory, 11th International Symposium, FCT 97, Kraków, Poland, September 1-3, 1997, Proceedings},
editor = {Bogdan S. Chlebus and Ludwik Czaja},
volume = {1279},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63386-3},
}