Pages that link to "Item:Q4718893"
From MaRDI portal
The following pages link to On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893):
Displaying 11 items.
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Autoreducibility, mitoticity, and immunity (Q881593) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Non-definability of Languages by Generalized First-order Formulas over (N,+) (Q2986821) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- (Q4231780) (← links)
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies (Q4800264) (← links)
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)