The following pages link to (Q3364203):
Displayed 11 items.
- Limitations of incremental dynamic programming (Q517805) (← links)
- A nondeterministic space-time tradeoff for linear codes (Q976097) (← links)
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- A lower bound on branching programs reading some bits twice (Q1392030) (← links)
- On uncertainty versus size in branching programs. (Q1401198) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Linear codes are hard for oblivious read-once parity branching programs (Q1606909) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- A note on read-$k$ times branching programs (Q4362278) (← links)
- On the hierarchy of nondeterministic branching k-programs (Q5055950) (← links)
- New lower bounds and hierarchy results for restricted branching programs (Q6184383) (← links)