Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
N. V. Vinodchandran. Counting Complexity of Solvable Black-Box Group Problems. SIAM Journal on Computing, 33(4):852-869, 2004. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Solvable Black-Box Group Problems Are Low for PPVikraman Arvind, N. V. Vinodchandran. STACS 1996: 99-110 Solvable Black-Box Group Problems are Low for PPVikraman Arvind, N. V. Vinodchandran. TCS, 180(1-2):17-45, 1997. [doi] Improved Lowness Results for Solvable Black-box Group ProblemsN. V. Vinodchandran. fsttcs 1997: 220-234 [doi]
The following publications are possibly variants of this publication: