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

Applicable Algebra in Engineering, Communications and Computing - Germany
doi 10.1007/s00200-019-00389-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Polynomial Ideals for Sandpiles and Their Gröbner Bases

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2002English

The Generic Gröbner Walk

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2007English

Essentially Optimal Computation of the Inverse of Generic Polynomial Matrices

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
2005English

Formal Verification of Integer Multipliers by Combining Gröbner Basis With Logic Reduction

2016English

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

International Journal of Algebra and Computation
Mathematics
2011English

Bivariate Jacobsthal and Jacobsthal Lucas Polynomial Sequences

Journal of Mathematics and Computer Science
Computational MechanicsComputational MathematicsComputer Science ApplicationsMathematics
2020English

Jacobi Fiber Surfaces for Bivariate Reeb Space Computation

IEEE Transactions on Visualization and Computer Graphics
Computer GraphicsPattern RecognitionComputer VisionComputer-Aided DesignSignal ProcessingSoftware
2017English

Polynomial Approximations for Bivariate Aggregate Claims Amount Probability Distributions

Methodology and Computing in Applied Probability
MathematicsStatisticsProbability
2015English

Low Complexity Cubing and Cube Root Computation Over $\F_{3^m}$ in Polynomial Basis

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy