Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Comparing reductions to NP-complete sets
Information and Computation
Strong reductions and isomorphism of complete sets
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
Verifying proofs in constant depth
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The complexity of membership problems for circuits over sets of positive numbers
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Verifying proofs in constant depth
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.00 |