The following pages link to Michael B. Monagan (Q1186701):
Displaying 50 items.
- (Q540330) (redirect page) (← links)
- Sparse polynomial division using a heap (Q540332) (← links)
- (Q749180) (redirect page) (← links)
- Perturbative solutions of quantum mechanical problems by symbolic computation (Q749182) (← links)
- Algorithms for solving linear systems over cyclotomic fields (Q987701) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Two perturbation calculations in fluid mechanics using large-expression management (Q1355784) (← links)
- Sparse multivariate Hensel lifting: a high-performance design and implementation (Q1662273) (← links)
- Factoring multivariate polynomials with many factors and huge coefficients (Q1798333) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- An interpolation algorithm for computing Dixon resultants (Q2109984) (← links)
- The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization (Q2110212) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- POLY: A New Polynomial Data Structure for Maple 17 (Q2799569) (← links)
- Computing Characteristic Polynomials of Matrices of Structured Polynomials (Q2830011) (← links)
- Using Sparse Interpolation in Hensel Lifting (Q2830017) (← links)
- On factorization of multivariate polynomials over algebraic number and function fields (Q2883817) (← links)
- Parallel sparse polynomial multiplication using heaps (Q2883826) (← links)
- Sparse Polynomial Powering Using Heaps (Q2915001) (← links)
- Algorithms for trigonometric polynomials (Q2958941) (← links)
- Fast rational function reconstruction (Q2958986) (← links)
- Rational simplification modulo a polynomial ideal (Q2958994) (← links)
- A Fast Parallel Sparse Polynomial GCD Algorithm (Q2985837) (← links)
- (Q3012177) (← links)
- Calculating cyclotomic polynomials (Q3094299) (← links)
- (Q3125574) (← links)
- (Q3139116) (← links)
- (Q3416643) (← links)
- (Q3416658) (← links)
- (Q3416669) (← links)
- (Q3416682) (← links)
- (Q3416693) (← links)
- (Q3416705) (← links)
- On the design and implementation of Brown's algorithm over the integers and number fields (Q3454769) (← links)
- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors (Q3508493) (← links)
- Lazy and Forgetful Polynomial Arithmetic and Applications (Q3644102) (← links)
- The First Case of Fermat's Last Theorem is True for all Prime Exponents up to 714,591,416,091,389 (Q3788083) (← links)
- (Q4002421) (← links)
- (Q4002478) (← links)
- (Q4004141) (← links)
- (Q4226972) (← links)
- (Q4234177) (← links)
- (Q4234326) (← links)
- (Q4250163) (← links)
- (Q4359470) (← links)
- (Q4382605) (← links)
- (Q4470456) (← links)
- PERTURBATIVE SOLUTIONS OF QUANTUM MECHANICAL PROBLEMS BY SYMBOLIC COMPUTATION: A REVIEW (Q4488298) (← links)
