On the last fall degree of zero-dimensional Weil descent systems
In this article we will discuss a mostly theoretical framework for solving zero-dimensional polynomial systems. Complexity bounds are obtained for solving such systems using a new parameter, called the last fall degree, which does not depend on the choice of a monomial order. The method is similar t...
Saved in:
Main Authors: | Huang, Ming-Deh A., Kosters, Michiel, Yang, Yun, Yeo, Sze Ling |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142369 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A New Collocation Scheme Using Non-polynomial Basis Functions
by: Zhang, Chao, et al.
Published: (2017) -
On a class of quadratic polynomials with no zeros and its application to APN functions
by: Bracken, C., et al.
Published: (2014) -
Polynomial addition sets of degree 3
by: ZHAN YANXIN
Published: (2010) -
Construction of conjugate quadrature filters with specified zeros
by: Lawton, W., et al.
Published: (2014) -
On graphs having no chromatic zeros in (1, 2)
by: Dong, F.M., et al.
Published: (2014)