Pages that link to "Item:Q848582"
From MaRDI portal
The following pages link to Bounds for resultants of univariate and bivariate polynomials (Q848582):
Displaying 18 items.
- Matrix algebraic properties of the Fisher information matrix of stationary processes (Q296456) (← links)
- Codes correcting restricted errors (Q670208) (← links)
- Bounds for absolute positiveness of multivariate polynomials (Q1264464) (← links)
- Number of common roots and resultant of two tropical univariate polynomials (Q1663533) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
- Efficient \(q\)-integer linear decomposition of multivariate polynomials (Q2029008) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
- (Q3732843) (← links)
- (Q3792777) (← links)
- Some applications of decomposable form equations to resultant equations (Q4325080) (← links)
- Fraction-free computation of the unit-circle resultant with any singularity profile (Q4965667) (← links)
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties (Q5018379) (← links)
- Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants (Q5121112) (← links)
- Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
