On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Star-Free Open Languages and Aperiodic Loops
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Generic oracles and oracle classes
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
ACM Transactions on Computational Logic (TOCL)
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
Quantum lower bound for recursive Fourier sampling
Quantum Information & Computation
Typed monoids: an Eilenberg-like theorem for non regular languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Random access to advice strings and collapsing results
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Protecting circuits from leakage: the computationally-bounded and noisy cases
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Linear circuits, two-variable logic and weakly blocked monoids
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Linear circuits, two-variable logic and weakly blocked monoids
Theoretical Computer Science
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |