Pages that link to "Item:Q689110"
From MaRDI portal
The following pages link to Polynomial factorization: Sharp bounds, efficient algorithms (Q689110):
Displaying 10 items.
- Algorithms for adaptive factorization of polynomials (Q1314605) (← links)
- Bounds on factors in \(\mathbb Z[x]\) (Q1930188) (← links)
- Single-factor coefficient bounds (Q2643575) (← links)
- (Q3356418) (← links)
- Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
- Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction (Q3600673) (← links)
- Each univariate complex polynomial has a ‘big’ factor (Q4294344) (← links)
- A history of solving some famous problems in mathematical analysis (Q5085688) (← links)
- (Q5104106) (← links)
- Practical polynomial factoring in polynomial time (Q5254167) (← links)