The following pages link to (Q3325040):
Displaying 38 items.
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- Faster polynomial multiplication via multipoint Kronecker substitution (Q840717) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- Cauchy index computation (Q1127957) (← links)
- Polynomial division with a remainder by means of evaluation and interpolation (Q1205721) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Variations on computing reciprocals of power series (Q1607045) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Computing the irreducible real factors and components of an algebraic curve (Q1814128) (← links)
- A note on the power of integer division (Q1838294) (← links)
- A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
- On using RSA/ECC coprocessor for ideal lattice-based key exchange (Q2145301) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- On the complexity of computing with planar algebraic curves (Q2254683) (← links)
- Modulated string searching (Q2437743) (← links)
- Faster deterministic integer factorization (Q2862533) (← links)
- On the rapid computation of various polylogarithmic constants (Q3127345) (← links)
- (Q4232508) (← links)
- Relative class number of imaginary Abelian fields of prime conductor below 10000 (Q4257701) (← links)
- Fast integer multiplication using generalized Fermat primes (Q4612576) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- Fast computation of elliptic curve isogenies in characteristic two (Q5034139) (← links)
- (Q5150372) (← links)
- (Q5150442) (← links)
- Towards an Implementation of a Computer Algebra System in a Functional Language (Q5505495) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Fast inversion of triangular Toeplitz matrices (Q5893874) (← links)
- Nearly optimal computations with structured matrices (Q5919809) (← links)
- Irregular primes and cyclotomic invariants to 12 million (Q5928882) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
- Fast evaluation and root finding for polynomials with floating-point coefficients (Q6615413) (← links)
