Pages that link to "Item:Q1759151"
From MaRDI portal
The following pages link to On the synthesis and complexity of formulae with bounded depth of alternation (Q1759151):
Displaying 3 items.
- Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028) (← links)
- Refined bounds on Shannon's function for complexity of circuits of functional elements (Q2088739) (← links)
- On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates (Q2332856) (← links)
