The following pages link to (Q4406533):
Displaying 50 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Polly cracker, revisited (Q285245) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach (Q314201) (← links)
- Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
- A non-NP-complete algorithm for a quasi-fixed polynomial problem (Q370288) (← links)
- Exact symbolic-numeric computation of planar algebraic curves (Q387800) (← links)
- Optimal algorithms of Gram-Schmidt type (Q393367) (← links)
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
- On the distribution of Atkin and Elkies primes (Q404278) (← links)
- A local decision test for sparse polynomials (Q407596) (← links)
- Non-linear polynomial selection for the number field sieve (Q412202) (← links)
- Approximate GCD of several univariate polynomials with small degree perturbations (Q412204) (← links)
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\) (Q412209) (← links)
- On the isotopic meshing of an algebraic implicit surface (Q414623) (← links)
- Sylvester's double sums: an inductive proof of the general case (Q414627) (← links)
- Efficient algorithms for order basis computation (Q420746) (← links)
- Moving in a network under random failures: a complexity analysis (Q433350) (← links)
- Intersecting two classical groups. (Q441406) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- The module isomorphism problem reconsidered. (Q468724) (← links)
- Subresultants, Sylvester sums and the rational interpolation problem (Q480645) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- A simple and fast online power series multiplication and its analysis (Q492037) (← links)
- A fast isomorphism test for groups whose Lie algebra has genus 2 (Q502735) (← links)
- Dynamics of linear systems over finite commutative rings (Q505656) (← links)
- A new faster algorithm for factoring skew polynomials over finite fields (Q507150) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- A lifting and recombination algorithm for rational factorization of sparse polynomials (Q609739) (← links)
- On the topology of real algebraic plane curves (Q626980) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Solving Łukasiewicz \(\mu\)-terms (Q683713) (← links)
- Specializations of indecomposable polynomials (Q692611) (← links)
- Large element orders and the characteristic of Lie-type simple groups. (Q731247) (← links)
- Constructive recognition of classical groups in odd characteristic. (Q731248) (← links)
- On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation (Q831966) (← links)
- Algorithms for near solutions to polynomial equations (Q840709) (← links)
- Structured matrices in the application of bivariate interpolation to curve implicitization (Q870441) (← links)
- Involutions of polynomially parametrized surfaces (Q893108) (← links)
- Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
- Class polynomials for nonholomorphic modular functions (Q898812) (← links)
- On weak keys and forgery attacks against polynomial-based MAC schemes (Q901368) (← links)
- Computational complexity of sentences over fields (Q937294) (← links)
- Degeneration of structured integer matrices modulo an integer (Q947675) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Counting reducible and singular bivariate polynomials (Q958607) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
