Pages that link to "Item:Q1872733"
From MaRDI portal
The following pages link to Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733):
Displayed 15 items.
- Decomposition of threshold functions into bounded fan-in threshold functions (Q383374) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication'' (Q386053) (← links)
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- The orbit problem is in the GapL hierarchy (Q626456) (← links)
- On the complexity of regular-grammars with integer attributes (Q632805) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- The Orbit Problem Is in the GapL Hierarchy (Q3511324) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)