Pages that link to "Item:Q2819593"
From MaRDI portal
The following pages link to Determinism versus non-determinism for linear time RAMs (extended abstract) (Q2819593):
Displayed 7 items.
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- Time-space tradeoffs for SAT on nonuniform machines (Q5956015) (← links)