Pages that link to "Item:Q1251077"
From MaRDI portal
The following pages link to Lower bounds on space complexity for contextfree recognition (Q1251077):
Displaying 8 items.
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space (Q1168735) (← links)
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- A combinatorial characterization of smooth LTCs and applications (Q2820271) (← links)
- Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties (Q3811712) (← links)