The following pages link to (Q4248250):
Displayed 50 items.
- Computation of unirational fields (Q2457397) (← links)
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction (Q2467321) (← links)
- A note on Gröbner bases and Berlekamp's algorithm (Q2474859) (← links)
- Change of order for regular chains in positive dimension (Q2476011) (← links)
- Gaussian laws for the main parameters of the Euclid algorithms (Q2482727) (← links)
- Faà di Bruno's formula, lattices, and partitions (Q2486068) (← links)
- Construction of explicit Runge-Kutta pairs with stiffness detection (Q2486761) (← links)
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem (Q2489927) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- On the complexity of the resolvent representation of some prime differential ideals (Q2496182) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem (Q2509276) (← links)
- The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
- On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders (Q2573796) (← links)
- An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (Q2577534) (← links)
- Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\) (Q2580254) (← links)
- Certified dense linear system solving (Q2643521) (← links)
- Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
- On the computation of rational solutions of underdetermined systems over a finite field (Q2685068) (← links)
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields (Q2792368) (← links)
- Computing periods of rational integrals (Q2796016) (← links)
- Bit Security of the CDH Problems over Finite Fields (Q2807226) (← links)
- The Mixed Binary Euclid Algorithm (Q2840536) (← links)
- Some Related Functions to Integer GCD and Coprimality (Q2840696) (← links)
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields (Q2871193) (← links)
- Computing Class Polynomials for Abelian Surfaces (Q2875530) (← links)
- EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS (Q2905283) (← links)
- Inversion Modulo Zero-Dimensional Regular Chains (Q2915000) (← links)
- Computing cardinalities of -curve reductions over finite fields (Q2971005) (← links)
- An Algorithm for Computing a Basis of a Finite Abelian Group (Q3014939) (← links)
- A $p$-adic algorithm to compute the Hilbert class polynomial (Q3055076) (← links)
- The complexity of class polynomial computation via floating point approximations (Q3055132) (← links)
- Computing modular polynomials in quasi-linear time (Q3055173) (← links)
- Computations with classical and <i>p</i>-adic modular forms (Q3092486) (← links)
- Automatic Calculation of Plane Loci Using Gröbner Bases and Integration into a Dynamic Geometry System (Q3102736) (← links)
- On the complexity of torus knot recognition (Q3120516) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES (Q3173933) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
- (Q3305164) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443) (← links)
- A Recursive Method for Computing Zeta Functions of Varieties (Q3430827) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
- Batched Point Location in SINR Diagrams via Algebraic Tools (Q3448774) (← links)
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) (Q3511179) (← links)
- ENERGY-AWARE STAGE ILLUMINATION (Q3521594) (← links)