Pages that link to "Item:Q914382"
From MaRDI portal
The following pages link to Lower bounds to the complexity of symmetric Boolean functions (Q914382):
Displayed 7 items.
- Functions that have read-once branching programs of quadratic size are not necessarily testable (Q1014387) (← links)
- Meanders and their applications in lower bounds arguments (Q1115606) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- On the complexity of planar Boolean circuits (Q1842774) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models (Q4265532) (← links)