Pages that link to "Item:Q1835900"
From MaRDI portal
The following pages link to Relating monotone formula size and monotone depth of Boolean functions (Q1835900):
Displayed 12 items.
- Certain sufficient conditions of uniformity for systems of functions of many-valued logic (Q263249) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Uniformity of a certain systems of functions of many-valued logic (Q355325) (← links)
- Replaceability and computational equivalence for monotone boolean functions (Q798296) (← links)
- Translating propositional extended conjunctions of Horn clauses into Boolean circuits (Q964389) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- Monotone circuits for monotone weighted threshold functions (Q1044746) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Applications of matrix methods to the theory of lower bounds in computational complexity (Q2638784) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)