Nullstellensätze for zero-dimensional Gröbner bases

DOI10.1007/s00037-009-0261-9zbMath1209.13035OpenAlexW1965859206MaRDI QIDQ626612

Amir Hashemi

Publication date: 18 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-009-0261-9

zbMATH Keywords

Gröbner basisGaussian eliminationMacaulay matrixbounds on polynomial degreeseffective Nullstellensätze

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Gröbner bases and cocyclic Hadamard matrices ⋮ Bounds for degrees of syzygies of polynomials defining a grade two ideal ⋮ Counting and enumerating feasible rotating schedules by means of Gröbner bases ⋮ SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING ⋮ A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields ⋮ A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares

This page was built for publication: Nullstellensätze for zero-dimensional Gröbner bases