Pages that link to "Item:Q2509028"
From MaRDI portal
The following pages link to The monotone circuit complexity of quadratic Boolean functions (Q2509028):
Displaying 9 items.
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- Reductions for monotone Boolean circuits (Q959813) (← links)
- Quadratic sequential computations of Boolean mappings (Q1882535) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity (Q2930293) (← links)
- An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits (Q4834386) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)
- THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS (Q5155649) (← links)
- Evaluating Monotone Circuits on Cylinders, Planes and Tori (Q5449839) (← links)
- Algorithms and Computation (Q5712145) (← links)