BibTeX
@inproceedings{DBLP:conf/mfcs/DurisR94,
author = {Pavol Duris and
Jos{\'e} D. P. Rolim},
title = {E-Complete Sets Do Not Have Optimal Polynomial Time Approximations},
booktitle = {MFCS},
year = {1994},
pages = {38-51},
ee = {http://dx.doi.org/10.1007/3-540-58338-6_57},
crossref = {DBLP:conf/mfcs/1994},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/mfcs/1994,
editor = {Igor Pr\'{\i}vara and
Branislav Rovan and
Peter Ruzicka},
title = {Mathematical Foundations of Computer Science 1994, 19th
International Symposium, MFCS'94, Kosice, Slovakia, August
22 - 26, 1994, Proceedings},
booktitle = {MFCS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {841},
year = {1994},
isbn = {3-540-58338-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2009-09-21 by Michael Ley (ley@uni-trier.de)