Solvable Black-Box Group Problems Are Low for PP

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.

Abstract

Abstract is missing.