Pages that link to "Item:Q3742752"
From MaRDI portal
The following pages link to A simplified lower bound for context-free-language recognition (Q3742752):
Displaying 4 items.
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES (Q5168415) (← links)
