Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Decision lists and related Boolean functions
Theoretical Computer Science
On unification for bounded distributive lattices
ACM Transactions on Computational Logic (TOCL)
On symmetric signatures in holographic algorithms
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Completeness for parity problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |