The following pages link to New Computational Paradigms (Q5717071):
Displaying 9 items.
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- On regular set systems containing regular subsystems (Q1979429) (← links)
- A reducibility for the dot-depth hierarchy (Q2575760) (← links)
- Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)
- (Q3789544) (← links)
- (Q5208602) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311150) (← links)
- On (alpha)_n-regular sets (Q5495646) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)