Pages that link to "Item:Q3722427"
From MaRDI portal
The following pages link to A logic for constant-depth circuits (Q3722427):
Displayed 13 items.
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Logically defined subsets of \(\mathbb{N}{}^ k\) (Q1186601) (← links)
- Formulas, regular languages and Boolean circuits (Q1193413) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
- Threshold circuits of bounded depth (Q2366275) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- Ehrenfeucht-Fraïssé Games on Random Structures (Q3638295) (← links)
- <i>y</i>= 2<i>x</i>VS.<i>y</i>= 3<i>x</i> (Q4358061) (← links)
- Tailoring recursion for complexity (Q4632420) (← links)
- Tailoring recursion for complexity (Q4858828) (← links)
- Parameterized Parallel Computing and First-Order Logic (Q5049039) (← links)