Pages that link to "Item:Q1872733"

The following pages link to Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733):

Displaying 14 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)
• Interval graph representation with given interval and intersection lengths (Q491160) (← 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)
• A transfer method from bounded existential Diophantine equations to Tarski algebra formulas (Q1686076) (← links)
• Knapsack in graph groups (Q1702854) (← links)
• Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
• Understanding cutting planes for QBFs (Q1784953) (← links)