Pages that link to "Item:Q2672949"
From MaRDI portal
The following pages link to Lower bounds for Boolean circuits of bounded negation width (Q2672949):
Displaying 7 items.
- An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Limiting negations in bounded-depth circuits: an extension of Markov's theorem (Q2390211) (← links)
- Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
- On Lower Bounds for Constant Width Arithmetic Circuits (Q3652250) (← links)
- Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits (Q5175995) (← links)