BibTeX
@inproceedings{DBLP:conf/focs/GrigorievV94,
author = {Dima Grigoriev and
Nicolai Vorobjov},
title = {Complexity Lower Bounds for Computation Trees with Elementary
Transcendental Function Gates},
booktitle = {FOCS},
year = {1994},
pages = {548-552},
crossref = {DBLP:conf/focs/FOCS35},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/focs/FOCS35,
title = {35th Annual Symposium on Foundations of Computer Science,
20-22 November 1994, Santa Fe, New Mexico, USA},
booktitle = {FOCS},
publisher = {IEEE},
year = {1994},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2006-04-25 by Michael Ley (ley@uni-trier.de)