Gap-definable counting classes
Journal of Computer and System Sciences
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
The Complexity of Tensor Circuit Evaluation
Computational Complexity
The complexity of two problems on arithmetic circuits
Theoretical Computer Science
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing
Autoreducibility, mitoticity, and immunity
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |