@inproceedings{DBLP:conf/coco/TodaO91,
author = {Seinosuke Toda and
Mitsunori Ogiwara},
title = {Counting Classes Are at Least as Hard as the Polynomial-Time
Hierarchy},
booktitle = {Structure in Complexity Theory Conference},
year = {1991},
pages = {2-12},
ee = {http://dx.doi.org/10.1109/SCT.1991.160238},
crossref = {DBLP:conf/coco/1991},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/coco/1991,
title = {Proceedings of the Sixth Annual Structure in Complexity
Theory Conference, Chicago, Illinois, USA, June 30 - July
3, 1991},
booktitle = {Structure in Complexity Theory Conference},
publisher = {IEEE Computer Society},
year = {1991},
isbn = {0-8186-2055-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}