Pages that link to "Item:Q3735077"
From MaRDI portal
The following pages link to Representations and Parallel Computations for Rational Functions (Q3735077):
Displaying 7 items.
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Depth-4 lower bounds, determinantal complexity: a unified approach (Q2281250) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
