ACM SIGACT News
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Almost-everywhere superiority for Quantum polynomial time
Information and Computation
SIGACT news complexity theory column 52
ACM SIGACT News
Hi-index | 0.00 |