## What is/are Computational Algebraic?

Computational Algebraic - Second, the existence of a unique global minimum and the convexity of the objective function of the considered nonlinear system are demonstrated by resorting to computational algebraic geometry concepts and tools, such as Grobner bases.^{[1]}A computational algebraic geometry technique is developed for determining nonlinear normal modes (NNMs) of multi-degree-of-freedom (MDOF) nonlinear dynamic systems.

^{[2]}We report, through different examples, the current development in GeoGebra, a widespread Dynamic Geometry software, of geometric automated reasoning tools by means of computational algebraic geometry algorithms.

^{[3]}By using the viewpoint of modern computational algebraic geometry, we explore properties of the optimization landscapes of the deep linear neural network models.

^{[4]}Our approach is based on theta bodies, a concept from computational algebraic geometry which is similar to the one of the better known Lasserre relaxations.

^{[5]}Thus, the recognition and analysis of image patterns based on these combinatorial structures benefits from the use of computational algebraic geometry to determine whether two given partial Latin squares describe the same affine algebraic set.

^{[6]}One of the first works in this field, a computational algebraic statistics, is given by Pistone and Wynn \citePistone-Wynn-1996, where the Gröbner basis theory is applied to the identifiability problem in the design of experiments.

^{[7]}From a computational algebraic viewpoint, the boundary of these regions is contained in the discriminant locus.

^{[8]}It is based on the modern technique of computational algebraic geometry, viz.

^{[9]}This allows us to reveal and exploit the underlying algebraic structure for GSC blocking matrix design using methods from computational algebraic geometry.

^{[10]}Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields.

^{[11]}In our approach, the IBP relations are first trimmed by modern tools from computational algebraic geometry and then solved by sparse linear algebra and our new interpolation method.

^{[12]}This report shows the results of using Computational Algebraic Applications (CAA) for mobile devices, intended as aid in college courses of Ordinary Differential Equations (ODE).

^{[13]}In this paper, we formulate a generic non-minimal solver using the existing tools of Polynomials Optimization Problems (POP) from computational algebraic geometry.

^{[14]}In order to delve into this last aspect, we improve in this paper the efficiency of the known methods on computational algebraic geometry to enumerate and classify partial Latin squares.

^{[15]}Such an objective is pursued by using linear algebra techniques to perform tasks that are usually carried out through computational algebraic geometry tools.

^{[16]}Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry.

^{[17]}

## computational algebraic geometry

Second, the existence of a unique global minimum and the convexity of the objective function of the considered nonlinear system are demonstrated by resorting to computational algebraic geometry concepts and tools, such as Grobner bases.^{[1]}A computational algebraic geometry technique is developed for determining nonlinear normal modes (NNMs) of multi-degree-of-freedom (MDOF) nonlinear dynamic systems.

^{[2]}We report, through different examples, the current development in GeoGebra, a widespread Dynamic Geometry software, of geometric automated reasoning tools by means of computational algebraic geometry algorithms.

^{[3]}By using the viewpoint of modern computational algebraic geometry, we explore properties of the optimization landscapes of the deep linear neural network models.

^{[4]}Our approach is based on theta bodies, a concept from computational algebraic geometry which is similar to the one of the better known Lasserre relaxations.

^{[5]}Thus, the recognition and analysis of image patterns based on these combinatorial structures benefits from the use of computational algebraic geometry to determine whether two given partial Latin squares describe the same affine algebraic set.

^{[6]}It is based on the modern technique of computational algebraic geometry, viz.

^{[7]}This allows us to reveal and exploit the underlying algebraic structure for GSC blocking matrix design using methods from computational algebraic geometry.

^{[8]}Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields.

^{[9]}In our approach, the IBP relations are first trimmed by modern tools from computational algebraic geometry and then solved by sparse linear algebra and our new interpolation method.

^{[10]}In this paper, we formulate a generic non-minimal solver using the existing tools of Polynomials Optimization Problems (POP) from computational algebraic geometry.

^{[11]}In order to delve into this last aspect, we improve in this paper the efficiency of the known methods on computational algebraic geometry to enumerate and classify partial Latin squares.

^{[12]}Such an objective is pursued by using linear algebra techniques to perform tasks that are usually carried out through computational algebraic geometry tools.

^{[13]}Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry.

^{[14]}