Pages that link to "Item:Q5954083"
From MaRDI portal
The following pages link to Lower bounds for the complexity of restrictions of Boolean functions (Q5954083):
Displaying 10 items.
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- Exact lower time bounds for computing Boolean functions on CREW PRAMs (Q1329159) (← links)
- Lower estimate for the cardinality of the domain of universal functions for the class of linear Boolean functions (Q1744294) (← links)
- Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
- A lower bound for the affinity level for almost all Boolean functions (Q3184567) (← links)
- (Q3335688) (← links)
- (Q3822100) (← links)
- Local complexity of Boolean functions (Q4443562) (← links)
- (Q4530740) (← links)
- Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (Q5368767) (← links)