Shallow multiplication circuits and wise financial investments
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal Circuits for Parallel Multipliers
IEEE Transactions on Computers
Limiting Negations in Formulas
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A new rank technique for formula size lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Monotone circuits for the majority function
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
A stronger LP bound for formula size lower bounds via clique constraints
Theoretical Computer Science
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |