The following pages link to (Q4732127):
Displaying 9 items.
- On learning embedded midbit functions (Q817826) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- Logically defined subsets of \(\mathbb{N}{}^ k\) (Q1186601) (← links)
- Formulas, regular languages and Boolean circuits (Q1193413) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
- Complexity of some problems from the theory of automata (Q3740247) (← links)
- Effective theories for circuits and automata (Q5264344) (← links)