The following pages link to (Q4248251):
Displaying 44 items.
- Bounds on the moduli of polynomial zeros (Q426947) (← links)
- Counting degenerate polynomials of fixed degree and bounded height (Q495309) (← links)
- Improvements of Lagrange's bound for polynomial roots (Q512362) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- Factoring polynomials over global fields (Q1032662) (← links)
- Generating families of irreducible quartics over \(\mathbb {Q}\) (Q1617762) (← links)
- Effective results on the Skolem problem for linear recurrence sequences (Q1634425) (← links)
- Bounds for the moduli of zeros. (Q1767162) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- On a problem in the theory of polynomials (Q2054727) (← links)
- Relations and bounds for the zeros of graph polynomials using vertex orbits (Q2180690) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Computational aspects of irreducible polynomials (Q2206416) (← links)
- An analytically treatable model of long-term dynamics in a mean motion resonance with coexisting resonant modes (Q2210852) (← links)
- On the minimum of a positive polynomial over the standard simplex (Q2269694) (← links)
- Generalized radix representations and dynamical systems. IV (Q2270503) (← links)
- Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
- Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
- On the Davenport-Mahler bound (Q2360668) (← links)
- On the distribution of polynomials with bounded height (Q2360745) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Complexity of real root isolation using continued fractions (Q2378508) (← links)
- Gessel-Stanton's inverse series and a system of \(q\)-polynomials (Q2452007) (← links)
- Estimations of positive roots of polynomials (Q2452946) (← links)
- From an approximate to an exact absolute polynomial factorization (Q2457357) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- Counting and Testing Dominant Polynomials (Q2813821) (← links)
- Computational Aspects of a Bound of Lagrange (Q2830025) (← links)
- (Q3388926) (← links)
- Generalizations of Gonçalves' inequality (Q3419993) (← links)
- The black-box Niederreiter algorithm and its implementation over the binary field (Q4417166) (← links)
- When Does a Given Polynomial with Integer Coefficients Divide Another? (Q4576108) (← links)
- A contraction of the Lucas polygon (Q4813722) (← links)
- Zero-free angular sectors and lens-shaped regions for polynomials, with applications to irreducibility (Q5072727) (← links)
- NEW FAMILIES OF IRREDUCIBLE TRINOMIALS AND QUADRINOMIALS (Q5075018) (← links)
- Robustness and Randomness (Q5302770) (← links)
- Decomposition and Construction of Neighbourhood Operations Using Linear Algebra (Q5458875) (← links)
- (Q5880309) (← links)
- An annulus for the zeros of polynomials (Q5917450) (← links)
- Zero counting for a class of univariate Pfaffian functions (Q5964515) (← links)
- On the zeros of univariate E-polynomials (Q6070540) (← links)
