A new algorithm for Grobner bases conversion
|
10.1016/j.jsc.2024.102391 |
1404 - 02 |
Machine learning parameter systems, Noether normalisations and quasi-stable positions
|
10.1016/j.jsc.2024.102345 |
1403 - 10 |
A Parametric F4 Algorithm
|
# |
1403 - 01 |
A single exponential time algorithm for homogeneous regular sequence tests
|
10.1142/S0219498824501457 |
1403 - 01 |
Recursive Structures in Involutive Bases Theory
|
10.1016/j.jsc.2023.01.003 |
1402 - 06 |
On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
|
# |
1402 - 05 |
A new algorithm for computing staggered linear bases
|
10.1016/j.jsc.2022.11.003 |
1402 - 04 |
Complementary decompositions of monomial ideals and involutive bases
|
10.1007/s00200-022-00569-0 |
1401 - 07 |
Computation of Macaulay constants and degree bounds for Grobner bases
|
10.1016/j.jsc.2021.11.004 |
1400 - 08 |
On the construction of staggered linear bases
|
10.1142/S0219498821501322 |
1400 - 04 |
On Bezout inequalities for non-homogeneous polynomial ideals
|
10.1016/j.jsc.2020.11.003 |
1400 - 04 |
An Involutive GVW Algorithm and the Computation of Pommaret Bases
|
10.1007/s11786-021-00512-5 |
1400 - 04 |
Relative Grobner and Involutive Bases for Ideals in Quotient Rings
|
10.1007/s11786-021-00513-4 |
1400 - 02 |
Computing the resolution regularity of bi-homogeneous ideals
|
10.1016/j.jsc.2019.12.001 |
1400 - 01 |
Deterministic normal position transformation and its applications
|
10.1016/j.tcs.2020.07.025 |
1399 - 07 |
Intrinsic complexity for constructing zero-Dimensional Grobner bases
|
# |
1399 - 07 |
Computing H-bases via minimal bases for syzygy modules
|
10.1080/03081087.2018.1539464 |
1399 - 04 |
Degree Upper Bounds for Involutive Bases
|
# |
1399 - 03 |
Dimension and depth dependent upper bounds in polynomial ideal theory
|
# |
1399 - 01 |
Compact Packings of the Plane with Three Sizes of Discs (full paper)
|
10.1007/s00454-019-00166-y |
1398 - 11 |