Pages that link to "Item:Q1872733"

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

Displaying 50 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)
• Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
• A transfer method from bounded existential Diophantine equations to Tarski algebra formulas (Q1686076) (← links)
• Knapsack in graph groups (Q1702854) (← links)
• Tree compression using string grammars (Q1742370) (← links)
• Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
• Understanding cutting planes for QBFs (Q1784953) (← links)
• Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704) (← links)
• Better complexity bounds for cost register automata (Q1999991) (← links)
• Dynamic complexity of expansion (Q2117075) (← links)
• A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
• Iterated multiplication in \(VTC^0\) (Q2155497) (← links)
• Skew circuits of small width (Q2173307) (← links)
• Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
• The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\) (Q2311889) (← links)
• Polynomial time relatively computable triangular arrays for almost sure convergence (Q2315247) (← links)
• Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\) (Q2339958) (← links)
• The conjugacy problem in free solvable groups and wreath products of abelian groups is in \({\mathsf {TC}^0}\) (Q2399376) (← links)
• Dual VP classes (Q2410687) (← links)
• Complexity of regular functions (Q2424670) (← links)
• A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
• Trace inclusion for one-counter nets revisited (Q2636512) (← links)
• Monomials, multilinearity and identity testing in simple read-restricted circuits (Q2637354) (← links)
• Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
• Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
• Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
• Bounded Treewidth and Space-Efficient Linear Algebra (Q2948475) (← links)
• A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
• Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
• Evaluating Matrix Circuits (Q3196387) (← links)
• Path Checking for MTL and TPTL over Data Words (Q3451113) (← links)
• The Orbit Problem Is in the GapL Hierarchy (Q3511324) (← links)
• (Q4553282) (← links)
• Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
• Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
• Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
• (Q5002805) (← links)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
• Parallel complexity for nilpotent groups (Q5084295) (← links)
• (Q5089240) (← links)