ACM SIGACT News
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
SIGACT news complexity theory column 53
ACM SIGACT News
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Random access to advice strings and collapsing results
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |