Pages that link to "Item:Q2575760"
From MaRDI portal
The following pages link to A reducibility for the dot-depth hierarchy (Q2575760):
Displaying 12 items.
- Fine hierarchies via Priestley duality (Q424549) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Improved Bounds for Reduction to Depth 4 and Depth 3 (Q2849964) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Constant Depth Reducibility (Q3325043) (← 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)
- STACS 2005 (Q5710672) (← links)
- New Computational Paradigms (Q5717071) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)