Pages that link to "Item:Q1130185"
From MaRDI portal
The following pages link to Neither reading few bits twice nor reading illegally helps much (Q1130185):
Displaying 13 items.
- Limitations of incremental dynamic programming (Q517805) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- 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)
- 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)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- Arthur-Merlin games in Boolean decision trees (Q1961380) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
