naa a22 4500 510736777 CHVBK 20180411083013.0 cr unu---uuuuu 180411e20130301xx s 000 0 eng 10.1007/s13366-011-0070-6 doi (NATIONALLICENCE)springer-10.1007/s13366-011-0070-6 Kaspar Stefan Fakultät für Informatik und Mathematik, Universität Passau, 94030, Passau, Germany aut Computing border bases without using a term ordering [Elektronische Daten] [Stefan Kaspar] Border bases, a generalization of Gröbner bases, have actively been researched during recent years due to their applicability to industrial problems. Kehrein and Kreuzer (J Pure Appl Alg 205:279-295, 2006) formulated the so called Border Basis Algorithm, an algorithm which allows the computation of border bases that relate to a degree compatible term ordering. In this paper we extend the original Border Basis Algorithm in such a way that also border bases that do not relate to any term ordering can be computed by it. The Managing Editors, 2011 Border basis nationallicence Term ordering nationallicence Marked polynomials nationallicence Symbolic computation nationallicence Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry Springer-Verlag 54/1(2013-03-01), 211-223 0138-4821 54:1<211 2013 54 13366 https://doi.org/10.1007/s13366-011-0070-6 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s13366-011-0070-6 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Kaspar Stefan Fakultät für Informatik und Mathematik, Universität Passau, 94030, Passau, Germany aut NATIONALLICENCE 773 0- Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry Springer-Verlag 54/1(2013-03-01), 211-223 0138-4821 54:1<211 2013 54 13366 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer