Pages that link to "Item:Q1567407"
From MaRDI portal
The following pages link to On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407):
Displaying 21 items.
- On the power of algebraic branching programs of width two (Q260398) (← links)
- A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\) (Q626674) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
- Dual VP classes (Q2410687) (← links)
- Characterizing \(\text{TC}^{0}\) in terms of infinite groups (Q2643132) (← links)
- Division in logspace-uniform NC (Q2773023) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- On the Power of Algebraic Branching Programs of Width Two (Q3012846) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) (← links)
- The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5215664) (← links)
- STACS 2005 (Q5710702) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
