Alexander E. Andreev. Effective Lower Bounds for Complexity of Some Classes of Schemes. In Lothar Budach, Rais Gatic Bakharajev, Oleg Borisovic Lipanov, editors, Fundamentals of Computation Theory, International Conference FCT 87, Kazan, USSR, June 22-26, 1987, Proceedings. Volume 278 of Lecture Notes in Computer Science, pages 24-29, Springer, 1987.
@inproceedings{Andreev87,
title = {Effective Lower Bounds for Complexity of Some Classes of Schemes},
author = {Alexander E. Andreev},
year = {1987},
tags = {e-science},
researchr = {https://researchr.org/publication/Andreev87},
cites = {0},
citedby = {0},
pages = {24-29},
booktitle = {Fundamentals of Computation Theory, International Conference FCT 87, Kazan, USSR, June 22-26, 1987, Proceedings},
editor = {Lothar Budach and Rais Gatic Bakharajev and Oleg Borisovic Lipanov},
volume = {278},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-18740-5},
}