Characterizing linear size circuits in terms of privacy
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Explicit lower bound of 4.5n - o(n) for boolena circuits
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An Explicit Lower Bound of 5n - o(n) for Boolean Circuits
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Reductions for monotone Boolean circuits
Theoretical Computer Science
Finding Efficient Circuits Using SAT-Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
New upper bounds on the Boolean circuit complexity of symmetric functions
Information Processing Letters
A well-mixed function with circuit complexity 5n ± o(n): tightness of the Lachish-Raz-type bounds
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Circuit complexity and multiplicative complexity of Boolean functions
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds
Theoretical Computer Science
An elementary proof of a 3n - o(n) lower bound on the circuit complexity of affine dispersers
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Reductions for monotone boolean circuits
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A 5n−o(n) lower bound on the circuit size over U2 of a linear Boolean function
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |