Pages that link to "Item:Q3470109"
From MaRDI portal
The following pages link to Very Fast Parallel Polynomial Arithmetic (Q3470109):
Displaying 16 items.
- Complexity of computation in finite fields (Q378003) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Matrix structures in parallel matrix computations (Q1122309) (← links)
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets (Q1276171) (← links)
- Resolution of Hartmanis' conjecture for NL-hard sparse sets (Q1575434) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Finding a vector orthogonal to roughly half a collection of vectors (Q2479315) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- On design of circuits of logarithmic depth for inversion in finite fields (Q3184560) (← links)
- (Q5089240) (← links)
- Knapsack and the power word problem in solvable Baumslag–Solitar groups (Q6159137) (← links)
