On the Complexity of Gröbner Bases Conversion

Journal of Symbolic Computation - United States
doi 10.1006/jsco.1998.0276
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Sharper Complexity Bounds for Zero-Dimensional Gröbner Bases and Polynomial System Solving

International Journal of Algebra and Computation
Mathematics
2011English

Operadic Gröbner Bases: An Implementation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Equivariant Gröbner Bases and the Gaussian Two-Factor Model

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2011English

Gröbner Bases and Minimum Distance of Affine Varieties Codes

TEMA - Tendências em Matemática Aplicada e Computacional
2012English

Hecke Algebras, Specht Modules and Gröbner–Shirshov Bases

Journal of Algebra
Number TheoryAlgebra
2002English

Polynomial Ideals for Sandpiles and Their Gröbner Bases

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2002English

Relative Gröbner–Shirshov Bases for Algebras and Groups

St. Petersburg Mathematical Journal
Applied MathematicsNumber TheoryAnalysisAlgebra
2008English

Gröbner Bases: A Short Introduction for Systems Theorists

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Structure of Gröbner Bases With Respect to Block Orders

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy