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

International Journal of Algebra and Computation - Singapore
doi 10.1142/s0218196711006364
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

Polynomial Ideals for Sandpiles and Their Gröbner Bases

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2002English

On the Complexity of Gröbner Bases Conversion

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1999English

On the Complexity Exponent of Polynomial System Solving

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2020English

Lower Bounds for Zero-Dimensional Projections

2009English

Relative Gröbner–Shirshov Bases for Algebras and Groups

St. Petersburg Mathematical Journal
Applied MathematicsNumber TheoryAnalysisAlgebra
2008English

Operadic Gröbner Bases: An Implementation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On the Bit Complexity of Solving Bilinear Polynomial Systems

2016English

Gröbner Bases: A Short Introduction for Systems Theorists

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Fast Gröbner Basis Computation and Polynomial Reduction for Generic Bivariate Ideals

Applicable Algebra in Engineering, Communications and Computing
Applied MathematicsNumber TheoryAlgebra
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy