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]
No references recorded for this publication.
No citations of this publication recorded.