Complexity of Gröbner basis detection and border basis detection
نویسندگان
چکیده
منابع مشابه
Complexity of Gröbner basis detection and border basis detection
Gröbner basis detection (GBD) is defined as follows: given a set of polynomials, decide whether there exists and if “yes” find a term order such that the set of polynomials is a Gröbner basis. This problem was proposed by Gritzmann and Sturmfels (1993) and it was shown to be NP-hard by Sturmfels and Wiegelmann. We investigate the computational complexity of this problem when the given set of po...
متن کاملOn Gröbner Basis Detection for Zero-dimensional Ideals
The Gröbner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if “yes” finda term order such that the set of polynomials is a Gröbner basis. This problem was shown to be NP-hard by Sturmfels and Wiegelmann. We show that GBD when studied in the context of zero dimensional ideals is also NP-hard. An algorithm to solve GBD for zero dimensiona...
متن کاملOn the Complexity of the F5 Gröbner basis Algorithm
We study the complexity of Gröbner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We give a bound on the number of polynomials of degree d in a Gröbner basis computed by Faugère’s F5 algorithm ([Fau02]) in this generic case for the grevlex ordering (which is also a bound on the number of polynomials ...
متن کاملRadial Basis Neural Network Based Islanding Detection in Distributed Generation
This article presents a Radial Basis Neural Network (RBNN) based islanding detection technique. Islanding detection and prevention is a mandatory requirement for grid-connected distributed generation (DG) systems. Several methods based on passive and active detection scheme have been proposed. While passive schemes have a large non detection zone (NDZ), concern has been raised on active method ...
متن کاملOn Border Basis and Gröbner Basis Schemes
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing zero-dimensional ideals when the coefficients are inexact. And in this situation they show a clear advantage with respect to Gröbner bases which, neverthele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.08.002