Computing border bases without using a term ordering

Braun, G., Pokutta, S.: Border Bases and Order Ideals: A Polyhedral Characterization. $${\tt arXiv:math\backslash0912.1502v2}$$ (2009)

Heldt D., Kreuzer M., Pokutta S., Poulisse H.: Approximate computation of zero-dimensional ideals. J.Symb. Comput. 44, 1566–1591 (2009)

Kehrein A., Kreuzer M.: Characterizations of border bases. J. Pure Appl. Alg. 196, 251–270 (2005)

Kehrein A., Kreuzer M., Robbiano L.: An algebraist’s view on border bases. In: Dickenstein, A., Emiris, I. (eds) Solving Polynomial Equations: Foundations, Algorithms, and Applications., pp. 169–202. Springer, Heidelberg (2005)

Kehrein A., Kreuzer M.: Computing border bases. J. Pure Appl. Alg. 205, 279–295 (2006)

Kreuzer M., Robbiano L.: Computational Commutative Algebra 2. Springer, Heidelberg (2005)

Mourrain B.: A new criterion for normal form algorithms. AAECC Lecture Notes in Computer Science 1719, 430–443 (1999)

Mourrain, B., Trébuchet, P.: Generalised normal forms and polynomial system solving. In: Proceedings of the 2005 international symposium on Symbolic and algebraic computation affiliation. pp. 253–260 (2005)

Stetter H.J.: Numerical Polynomial Algebra. SIAM, Philadephia (2004)

The ApCoCoA Team, ApCoCoA : Applied Computations in Commutative Algebra. http://www.apcocoa.org (2011)

The CoCoA Team, CoCoA : A System for Doing Computations in Commutative Algebra. http://cocoa.dima.unige.it (2011)