The following pages link to Modern Computer Algebra (Q2862994):
Displaying 50 items.
- Algorithmic issues of AND-decomposition of Boolean formulas (Q300345) (← links)
- Even faster integer multiplication (Q306687) (← links)
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Construction and number of self-dual skew codes over \(\mathbb{F}_{p^2}\) (Q340169) (← links)
- Relaxed Hensel lifting of triangular sets (Q480691) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Bivariate triangular decompositions in the presence of asymptotes (Q512372) (← links)
- All hyperbolic Coxeter \(n\)-cubes (Q721054) (← links)
- Modular composition via factorization (Q722764) (← links)
- Factorizations for difference operators (Q738518) (← links)
- Efficient rational creative telescoping (Q820942) (← links)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions (Q820943) (← links)
- Computational schemes for subresultant chains (Q831961) (← links)
- Decoupling multivariate fractions (Q831984) (← links)
- Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions (Q832348) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- On the complexity of inverting integer and polynomial matrices (Q901933) (← links)
- Smoothness test for polynomials defined over small characteristic finite fields (Q1616168) (← links)
- Polynomial-exponential decomposition from moments (Q1620891) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Quantum compression relative to a set of measurements (Q1649993) (← links)
- Artin-Schreier extensions of normal bases (Q1654507) (← links)
- Stabilization bounds for linear finite dynamical systems (Q1663544) (← links)
- The set of unattainable points for the rational Hermite interpolation problem (Q1680295) (← links)
- Algorithms for commutative algebras over the rational numbers (Q1704817) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Constructing dominating sets in circulant graphs (Q1745909) (← links)
- Left-invariant Einstein metrics on \(S^3 \times S^3\) (Q1747950) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- On degrees of modular common divisors and the big prime gcd algorithm (Q1751453) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- A first step towards the skew duadic codes (Q1784999) (← links)
- Identity testing and interpolation from high powers of polynomials of large degree over finite fields (Q1791682) (← links)
- A probabilistic algorithm for verifying polynomial middle product in linear time (Q1799565) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Counting invariant subspaces and decompositions of additive polynomials (Q1994893) (← links)
- Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) (Q1994975) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Computing the equisingularity type of a pseudo-irreducible polynomial (Q2025447) (← links)
- Factorization of Boolean polynomials: parallel algorithms and experimental evaluation (Q2027854) (← links)
- An algorithm for constructing the resultant of two entire functions (Q2027858) (← links)
- Efficient \(q\)-integer linear decomposition of multivariate polynomials (Q2029008) (← links)
- Mechanisation of the AKS algorithm (Q2031415) (← links)
- Asymptotics of 3-stack-sortable permutations (Q2034079) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
