Publication date
August 2018
DOIAbstract
Computation of two Groebner bases required by our algorithm for transforming cartesian coordinates into geodetic coordinates
Computation of two Groebner bases required by our algorithm for transforming cartesian coordinates into geodetic coordinates
The Gröbner Basis are an important tool in Computational Algebra, Commutative Algebra and Algebraic ...
The book presents modern and efficient methods for solving Geodetic and Geoinformatics algebraic pro...
The three-dimensional (3-D) resection problemis usually solved by first obtaining the distancesconne...
Computation of two Groebner bases required by our algorithm for transforming cartesian coordinates i...
In geodesy and geoinformatics, most problems are nonlinear in nature and often require the solution ...
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for...
SIGLEAvailable from TIB Hannover: RA 7759(402) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Te...
SIGLEINIST T 71058 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
At a Dagstuhl meeting a few years ago, I gave a tutorial lecture about Groebner bases whose emphasis...
This contribution extends the previous work of (2005). Using Groebner basis and Dixon resultant as t...
Abstract—In this paper we improve the computer algorithm of Zhou and Winkler for computing relative ...
The Groebner Walk is an algorithm which converts a given Groebner basis of a polynominal ideal I of ...
A new method for the mechanical elementary geometry theorem proving is presented by using Groebner b...
AbstractThe classical method of Gröbner bases for multivariate polynomials in computer algebra and t...
The Gröbner Basis are an important tool in Computational Algebra, Commutative Algebra and Algebraic ...
The book presents modern and efficient methods for solving Geodetic and Geoinformatics algebraic pro...
The three-dimensional (3-D) resection problemis usually solved by first obtaining the distancesconne...
Computation of two Groebner bases required by our algorithm for transforming cartesian coordinates i...
In geodesy and geoinformatics, most problems are nonlinear in nature and often require the solution ...
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for...
SIGLEAvailable from TIB Hannover: RA 7759(402) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Te...
SIGLEINIST T 71058 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
We study Groebner bases and their applications in our thesis. We give a detailed proof of Dickson\u2...
At a Dagstuhl meeting a few years ago, I gave a tutorial lecture about Groebner bases whose emphasis...
This contribution extends the previous work of (2005). Using Groebner basis and Dixon resultant as t...
Abstract—In this paper we improve the computer algorithm of Zhou and Winkler for computing relative ...
The Groebner Walk is an algorithm which converts a given Groebner basis of a polynominal ideal I of ...
A new method for the mechanical elementary geometry theorem proving is presented by using Groebner b...
AbstractThe classical method of Gröbner bases for multivariate polynomials in computer algebra and t...
The Gröbner Basis are an important tool in Computational Algebra, Commutative Algebra and Algebraic ...
The book presents modern and efficient methods for solving Geodetic and Geoinformatics algebraic pro...
The three-dimensional (3-D) resection problemis usually solved by first obtaining the distancesconne...
Add to ORKG