Quantcast

Structural Gröbner Basis Detection

Research paper by Bernd Sturmfels, Markus Wiegelmann

Indexed on: 01 Apr '97Published on: 01 Apr '97Published in: Applicable Algebra in Engineering, Communication and Computing



Abstract

 We determine the computational complexity of deciding whether m polynomials in n variables have relatively prime leading terms with respect to some term order. This problem in NP-complete in general, but solvable in polynomial time in two different situations, when m is fixed and when n−m is fixed. Our new algorithm for the second case determines a candidate set of leading terms by solving a maximum matching problem. This reduces the problem to linear programming.