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
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SIGACT news complexity theory column 52
ACM SIGACT News
NE is not NP turing reducible to nonexponentially dense NP sets
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 5.23 |