Pages that link to "Item:Q3748273"
From MaRDI portal
The following pages link to Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines (Q3748273):
Displayed 14 items.
- On the power of several queues (Q685436) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines (Q808247) (← links)
- Expanders obtained from affine transformations (Q1098859) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- A separator theorem for one-dimensional graphs under linear mapping (Q1109791) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines (Q1122982) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines with output tape (Q1208717) (← links)
- Three one-way heads cannot do string matching (Q1318467) (← links)
- Two tapes versus one for off-line Turing machines (Q1321033) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- The speed of copying on one-tape off-line turing machines (Q1824387) (← links)
- On 3-pushdown graphs with large separators (Q2277467) (← links)