Pages that link to "Item:Q1322486"
From MaRDI portal
The following pages link to Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\) (Q1322486):
Displayed 6 items.
- Attribute-efficient learning in query and mistake-bound models (Q1271616) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Identification of partial disjunction, parity, and threshold functions (Q1978506) (← links)
- Beating treewidth for average-case subgraph isomorphism (Q2041983) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- Coloring k-colorable graphs in constant expected parallel time (Q6143974) (← links)