Complexity of standard bases in projective dimension zero
From MaRDI portal
Publication:5393360
DOI10.1007/3-540-51517-8_136zbMath1209.13034OpenAlexW1561492443MaRDI QIDQ5393360
Publication date: 16 April 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-51517-8_136
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (3)
Equations for the projective closure and effective Nullstellensatz ⋮ The membership problem for unmixed polynomial ideals is solvable in single exponential time ⋮ On the bit complexity of polynomial system solving
This page was built for publication: Complexity of standard bases in projective dimension zero
