Limiting negations in non-deterministic circuits
From MaRDI portal
(Redirected from Publication:837192)
Recommendations
Cites work
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 3513337 (Why is no real title available?)
- scientific article; zbMATH DE number 3999837 (Why is no real title available?)
- A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
- Algorithms and Computation
- An exponential gap with the removal of one negation gate
- Characterizing non-deterministic circuit size
- Limiting Negations in Constant Depth Circuits
- Negation-Limited Inverters of Linear Size
- On the Complexity of Negation-Limited Boolean Networks
- On the Inversion Complexity of a System of Functions
- On the minimum number of negations leading to super-polynomial savings
- On the negation-limited circuit complexity of merging
- The monotone circuit complexity of Boolean functions
Cited in
(9)- Limiting Negations in Formulas
- Limiting Negations in Constant Depth Circuits
- A curious new result in switching theory
- On negation complexity of injections, surjections and collision-resistance in cryptography
- Inhibited Effects in CP-Logic
- Limiting negations in bounded-depth circuits: an extension of Markov's theorem
- Lower bounds for Boolean circuits of bounded negation width
- Negation-Limited Inverters of Linear Size
- Exact value of the nonmonotone complexity of Boolean functions
This page was built for publication: Limiting negations in non-deterministic circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837192)
