The following pages link to (Q4248250):
Displayed 50 items.
- Linear differential operators for polynomial equations (Q1864893) (← links)
- Relax, but don't be too lazy (Q1866999) (← links)
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\) (Q1874655) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Complexity results for triangular sets (Q1878489) (← links)
- High-order lifting and integrality certification (Q1878491) (← links)
- Efficient data mappings for parity-declustered data layouts (Q1884842) (← links)
- Real closures of models of weak arithmetic (Q1935370) (← links)
- Usage of modular techniques for efficient computation of ideal operations (Q1993362) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Symbolic analysis of multiple steady states in a MAPK chemical reaction network (Q1994887) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Deterministic normal position transformation and its applications (Q2006776) (← links)
- Complexity bounds on Semaev's naive index calculus method for ECDLP (Q2025337) (← links)
- Dynamical irreducibility of polynomials modulo primes (Q2043070) (← links)
- 2-adic point counting on \(K3\) surfaces (Q2093672) (← links)
- Locating the closest singularity in a polynomial homotopy (Q2109994) (← links)
- On the number of solutions of systems of certain diagonal equations over finite fields (Q2116748) (← links)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- Sparse polynomial interpolation based on diversification (Q2143469) (← links)
- Symbolic computations of first integrals for polynomial vector fields (Q2194771) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- On the length of integers in telescopers for proper hypergeometric terms (Q2252118) (← links)
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition (Q2252120) (← links)
- On irreducible divisors of iterated polynomials (Q2256067) (← links)
- Efficient construction of maximal and minimal representations of motifs of a string (Q2271439) (← links)
- Factorization patterns on nonlinear families of univariate polynomials over a finite field (Q2304196) (← links)
- Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
- Chinese remainder theorem for cyclotomic polynomials in \(\mathbb Z[X]\) (Q2344290) (← links)
- Efficient sampling of non-strict turnstile data streams (Q2348042) (← links)
- 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)