Pages that link to "Item:Q859980"

The following pages link to Languages polylog-time reducible to dot-depth 1/2 (Q859980):

Displaying 4 items.

• Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
• Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
• Machines that can output empty words (Q2272215) (← links)
• Hierarchies and reducibilities on regular languages related to modulo counting (Q3549290) (← links)