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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: May 9, 1996; revised version: December 19, 1996
Rights and permissions
About this article
Cite this article
Sturmfels, B., Wiegelmann, M. Structural Gröbner Basis Detection. AAECC 8, 257–263 (1997). https://doi.org/10.1007/s002000050063
Issue Date:
DOI: https://doi.org/10.1007/s002000050063