The complexity of promise problems with applications to public-key cryptography
Information and Control
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The strong exponential hierarchy collapses
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Structural complexity 1
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Computing functions with parallel queries to NP
Theoretical Computer Science
ACM SIGACT News
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
On the nlog n isomorphism technique (A Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On Limited versus Polynomial Nondeterminism
On Limited versus Polynomial Nondeterminism
Solvable Group Isomorphism is (almost) in NP " CoNP
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Information and Computation
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
Motivated by Papadimitriou and Yannakakis' paper on limited nondeterminism [19], we study two questions arising from their work: Quasigroup Isomorphism and the Minimum generating set problem for groups and quasigroups.