Pages that link to "Item:Q1337147"
From MaRDI portal
The following pages link to Space-efficient recognition of sparse self-reducible languages (Q1337147):
Displaying 5 items.
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- (Q4972729) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)