Vikraman Arvind, N. V. Vinodchandran. Solvable Black-Box Group Problems Are Low for PP. In Claude Puech, Rüdiger Reischuk, editors, STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings. Volume 1046 of Lecture Notes in Computer Science, pages 99-110, Springer, 1996.
@inproceedings{ArvindV96,
title = {Solvable Black-Box Group Problems Are Low for PP},
author = {Vikraman Arvind and N. V. Vinodchandran},
year = {1996},
researchr = {https://researchr.org/publication/ArvindV96},
cites = {0},
citedby = {0},
pages = {99-110},
booktitle = {STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings},
editor = {Claude Puech and Rüdiger Reischuk},
volume = {1046},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60922-9},
}