Pages that link to "Item:Q3569022"
From MaRDI portal
The following pages link to A superpolynomial lower bound for (1,+k(n))-branching programs (Q3569022):
Displayed 4 items.
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- A lower bound on branching programs reading some bits twice (Q1392030) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)