Pages that link to "Item:Q1392030"
From MaRDI portal
The following pages link to A lower bound on branching programs reading some bits twice (Q1392030):
Displaying 7 items.
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
- On Nečiporuk's theorem for branching programs (Q1121017) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- New lower bounds and hierarchy results for restricted branching programs (Q1816743) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
