Pages that link to "Item:Q3767263"
From MaRDI portal
The following pages link to Definability by constant-depth polynomial-size circuits (Q3767263):
Displayed 15 items.
- Aggregate operators in constraint query languages (Q696963) (← links)
- Generalized lower bounds derived from Hastad's main lemma (Q1107987) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- Properties of symmetric Boolean functions (Q1670318) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Ehrenfeucht-Fraïssé Games on Random Structures (Q3638295) (← links)
- (Q5079744) (← links)
- (Q5227514) (← links)