Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
New upper bounds on the Boolean circuit complexity of symmetric functions | Information Processing Letters |
| 11 | 2010 |
Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table | SIAM Journal on Computing |
| 17 | 2008 |
10.1016/S0166-218X(02)00410-9 | 2003 | |||
10.1023/A:1009812409930 | 1999 | |||
A lower bound on CNF encodings of the at-most-one constraint | Theoretical Computer Science |
| 3 | 2019 |