The following pages link to (Q4248250):
Displayed 50 items.
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
- The Rabin cryptosystem revisited (Q2349533) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Arithmetic complexity of certain linear transformations (Q2352607) (← links)
- The arithmetic computational complexity of linear transforms (Q2356497) (← links)
- On the computation of rational points of a hypersurface over a finite field (Q2360665) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Complexity of integer quasiconvex polynomial optimization (Q2387421) (← links)
- Quotients of polynomial rings and regular \(t\)-balanced Cayley maps on abelian groups (Q2400971) (← links)
- Simple forms of higher-order linear differential systems and their applications in computing regular solutions (Q2430021) (← links)
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic (Q2430987) (← links)
- Representation attacks on the Braid Diffie-Hellman public key encryption (Q2432563) (← links)
- Zero-nonzero and real-nonreal sign determination (Q2435509) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals (Q2457334) (← links)
- An algorithm to solve integer linear systems exactly using numerical methods (Q2457353) (← links)
- A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs (Q2457360) (← links)
- Polynomial root separation examples (Q2457387) (← links)
- 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)