Pages that link to "Item:Q685708"
From MaRDI portal
The following pages link to \(NC^ 1\): The automata-theoretic viewpoint (Q685708):
Displaying 20 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Languages recognized by finite aperiodic groupoids (Q1274931) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- Programs over semigroups of dot-depth one (Q1575738) (← links)
- On the computational power of programs over \(\mathsf{BA}_2\) monoid (Q2232262) (← links)
- A topological approach to non-uniform complexity (Q2280323) (← links)
- Cost Register Automata for Nested Words (Q2817901) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- (Q5094140) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
- (Q5101347) (← links)
- The Power of Programs over Monoids in DA (Q5111216) (← links)
- The Power of Diversity (Q5200079) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
