Pages that link to "Item:Q1184988"
From MaRDI portal
The following pages link to Nonuniform complexity and the randomness of certain complete languages (Q1184988):
Displaying 8 items.
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- Random languages for nonuniform complexity classes (Q1179458) (← links)
- Necessary conditions for subclasses of random context languages (Q1939280) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Randomness of formal languages via automatic martingales (Q2420647) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Random strings and truth-table degrees of Turing complete c.e. sets (Q2921112) (← links)
- (Q5752559) (← links)