Limiting Negations in Constant Depth Circuits
From MaRDI portal
Publication:4032939
Recommendations
- Limiting negations in non-deterministic circuits
- scientific article; zbMATH DE number 176507
- Algorithms and Computation
- Limiting negations in bounded-depth circuits: an extension of Markov's theorem
- scientific article; zbMATH DE number 1263235
- Limiting negations in bounded treewidth and upward planar circuits
- Negation-limited complexity of parity and inverters
- Negation-Limited Complexity of Parity and Inverters
- A logic for constant-depth circuits
- scientific article; zbMATH DE number 1379306
Cited in
(18)- Limiting negations in non-deterministic circuits
- On the minimum number of negations leading to super-polynomial savings
- A logic for constant-depth circuits
- scientific article; zbMATH DE number 176507 (Why is no real title available?)
- The average sensitivity of bounded-depth circuits
- On the mystery of negations in circuits: structure vs power
- Learning circuits with few negations
- Negation-limited formulas
- On negation complexity of injections, surjections and collision-resistance in cryptography
- Inhibited Effects in CP-Logic
- Algorithms and Computation
- Cancellation-free circuits in unbounded and bounded depth
- 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
- Limiting negations in bounded treewidth and upward planar circuits
- Negation-limited circuit complexity of symmetric functions
- New bounds for energy complexity of Boolean functions
This page was built for publication: Limiting Negations in Constant Depth Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032939)
