The following pages link to Non-uniform automata over groups (Q804303):
Displaying 38 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- Ultrafilters on words for a fragment of logic (Q896678) (← links)
- An impossibility gap between width-4 and width-5 permutation branching programs (Q1041742) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- Formulas, regular languages and Boolean circuits (Q1193413) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- Spectral properties of threshold functions (Q1323477) (← links)
- Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Circuits constructed with MOD\(_ q\) gates cannot compute ``and'' in sublinear size (Q1346618) (← links)
- A note on a theorem of Barrington, Straubing and Thérien (Q1351160) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- Finite semigroup varieties defined by programs (Q1390876) (← links)
- Programs over semigroups of dot-depth one (Q1575738) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- The complexity of solving equations over finite groups (Q1854566) (← links)
- Inapproximability results for equations over finite groups (Q1884871) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- On the computational power of programs over \(\mathsf{BA}_2\) monoid (Q2232262) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups (Q2258015) (← links)
- A topological approach to non-uniform complexity (Q2280323) (← links)
- Homomorphic public-key cryptosystems and encrypting Boolean circuits (Q2432559) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- Satisfiability in MultiValued Circuits (Q5080482) (← links)
- (Q5094140) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
- The Power of Programs over Monoids in DA (Q5111216) (← links)
- (Q5121894) (← links)
