Pages that link to "Item:Q3926063"
From MaRDI portal
The following pages link to Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata (Q3926063):
Displayed 16 items.
- Extension complexity of formal languages (Q778518) (← links)
- Isomorphisms and 1-L reductions (Q1107310) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← links)
- A survey of space complexity (Q1193412) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization (Q1362330) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Complexity theory for splicing systems (Q2455600) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- Some modifications of auxiliary pushdown automata (Q3485868) (← links)
- The degree structure of 1-L reductions (Q5096826) (← links)
- On languages accepted with simultaneous complexity bounds and their ranking problem (Q5096881) (← links)