Pages that link to "Item:Q2453555"
From MaRDI portal
The following pages link to Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555):
Displaying 7 items.
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Proper hierarchies in polylogarithmic time and absence of complete problems (Q2206779) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy (Q3617079) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311150) (← links)
- Developments in Language Theory (Q5711979) (← links)