- Gradual sub-lattice reduction and a new complexity for factoring polynomials
- Computing parametrizations of rational algebraic curves
- Solving Recurrence Relations using Local Invariants Yongjae Cha
- Solving Second Order Linear Differential Equations with Klein's Theorem
- THE FLORIDA STATE UNIVERSITY COLLEGE OF ARTS AND SCIENCES
- J. Symbolic Computation (1996) 11, 1--000 Rational Parametrizations of Algebraic Curves using
- K. Belabas A relative van Hoeij algorithm over number fields, J. Symbolic Computation, 37 (2004), pp. 641--668. K. Belabas, M. van Hoeij, J. Kl uners, A. Steel, Factoring polynomials over global fields, arXiv:math/0409510v1 (2004).
- Algorithms for Polynomial GCD Computation over Algebraic Function Fields
- K. Belabas A relative van Hoeij algorithm over number fields, J. Symbolic Computation, 37 (2004), pp. 641668. K. Belabas, M. van Hoeij, J. Kluners, A. Steel, Factoring polynomials over global fields, arXiv:math/0409510v1 (2004).
- Towards Factoring Bivariate Approximate Polynomials Robert M. Corless y Mark W. Giesbrecht y Mark van Hoeij z Ilias S. Kotsireas y Stephen M. Watt y
- Finding all Bessel type solutions for Linear Differential Equations with Rational Function Coefficients
- PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
- An algorithm for computing the Weierstrass normal form
- Apparent Singularities of Linear Difference Equations with Polynomial Coefficients
- Subanalytic Solutions of Linear Difference Equations and Multidimensional
- Liouvillian Solutions of Irreducible Linear Difference Yongjae Cha
- The problem Kovacic Algorithm Klein's Theorem and the Algorithm. Conclusion Solving Second Order Linear Differential Equations
- Closed Form Solutions for Linear Differential and Difference Equations, Project Description
- AF:Small: Solving Linear Differential Equations in terms of Special Functions, Project Description
- Approximate Bivariate Factorization, a Geometric Andre Galligo
- Factoring Univariate Polynomials over the Andy Novocin
- Generating Subfields Mark van Hoeij
- Practical Polynomial Factoring in Polynomial Time William Hart
- Computing Riemann Theta Functions Bernard Deconinck
- K. Belabas A relative van Hoeij algorithm over number fields, J. Symbolic Computation, 37 (2004), pp. 641668. K. Belabas, M. van Hoeij, J. Kluners, A. Steel, Factoring polynomials over global fields, arXiv:math/0409510v1 (2004).
- Why I do what I do An informal research statement
- Practical polynomial factoring in polynomial time William Hart
- STUDENT SYLLABUS MAC 231207 Spring 2010 TIME AND PLACE: Monday 11:15 -12:05, Tuesday+Thursday 11:00 -12:15, in LOV 201.
- J. Symbolic Computation (1997) 11, 1--000 Factorization of Differential Operators with Rational
- J. Symbolic Computation (1995) 11, 1--000 An algorithm for computing an integral basis in an
- A Modular GCD algorithm over Number Fields presented with Multiple Extensions.
- J. Symbolic Computation (1997) 11, 1--000 Formal Solutions and Factorization of Differential
- 2-descent for Second Order Linear Differential Equations Tingting Fang & Mark van Hoeij
- Solving Linear Recurrence Equations Yongjae Cha
- Factoring polynomials and the knapsack problem. Mark van Hoeij *
- Solving Third Order Linear Differential Equations in Terms of Second Order Equations
- !#"$%&')(1032 465!07 (1! 98@BA C!0)4
- Liouvillian Solutions of Irreducible Second Order Linear Difference Equations
- syllabus http://www.math.fsu.edu/~hoeij/fall2005/MAS4302.html 1 of 2 08/31/05 14:00
- A polynomial with Galois group M12 f = 3x12+ 100x11+ 1350x10+ 9300x9 + 32925x8 + 45000x7 -43500x6
- A Modular GCD algorithm over Number Fields presented with Multiple Extensions.
- A method for the Integration of Solutions of Ore Equations Sergei A. Abramov Mark van Hoeij
- BANACH CENTER PUBLICATIONS, VOLUME ** INSTITUTEPOFOMATHEMATICSLISH ACADEMY OF SCIENCES
- The Minimum Polynomial of an Algebraic Solution of Abel's problem.
- Rational Solutions of the Mixed Differential Equation and its Application
- THE FLORIDA STATE UNIVERSITY COLLEGE OF ARTS AND SCIENCES
- Factorization of Linear Differential Operators een wetenschappelijke proeve op het gebied van de
- Rational Solutions of Linear Difference Equations Mark van Hoeij
- Complexity results for factoring univariate polynomials over the rationals (version 0.3)
- Desingularization of linear difference operators with polynomial coefficien* Sergei A. Abramov* Mark van Hoeijy
- Set of Poles of Solutions of Linear Difference Equations with Polynomial Coefficients
- A Modular Algorithm to Compute the Exponential Solutions of a Linear Differential Operator
- Isomorphisms of Algebraic Number Fields Mark van Hoeij and Vivek Pal
- A Modular GCD algorithm over Number Fields presented with Multiple Extensions.
- A conjecture in the problem of rational definite summation
- J. Symbolic Computation (1998) 11, 1-17 Liouvillian Solutions of Linear Differential Equations of Order
- Factoring polynomials and 0-1 vectors Mark van Hoeij
- FACTORING POLYNOMIALS OVER GLOBAL FIELDS KARIM BELABAS, MARK VAN HOEIJ, J"URGEN KL"UNERS, AND ALLAN STEEL
- Generating Subfields Mark van Hoeij
- 2-descent for Linear Differential Equations Tingting Fang
