Smallest Formulas for Parity of 2k Variables Are Essentially Unique
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Theoretical Computer Science
A new rank technique for formula size lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the average sensitivity of testing square-free numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Note: Smallest formulas for the parity of 2 k variables are essentially unique
Theoretical Computer Science
Breaking the rectangle bound barrier against formula size lower bounds
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A stronger LP bound for formula size lower bounds via clique constraints
Theoretical Computer Science
Hi-index | 5.23 |