Pages that link to "Item:Q1064067"
From MaRDI portal
The following pages link to Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit (Q1064067):
Displaying 6 items.
- An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines with output tape (Q1208717) (← links)
- On the simulation of many storage heads by one (Q1348528) (← links)
- The Theta-Model: achieving synchrony without clocks (Q2377129) (← links)