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
Limiting negations in bounded-depth circuits: an extension of Markov's theorem
Information Processing Letters
Limiting Negations in Formulas
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Note: Limiting negations in non-deterministic circuits
Theoretical Computer Science
Limiting negations in bounded treewidth and upward planar circuits
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Hi-index | 0.00 |