On the complexity of negation-limited Boolean networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
More on the complexity of negation-limited circuits
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the minimum number of negations leading to super-polynomial savings
Information Processing Letters
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
Finding efficient circuits for ensemble computation
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Fast monotone summation over disjoint sets
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Fast monotone summation over disjoint sets
Information Processing Letters
| Hi-index | 0.00 |