The geobucket data structure for polynomials
From MaRDI portal
Publication:1264445
DOI10.1006/jsco.1997.0176zbMath0927.68124OpenAlexW1980349404MaRDI QIDQ1264445
Publication date: 29 November 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/7262
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (6)
Compact representation of polynomials for algorithms for computing Gröbner and involutive bases ⋮ Computing inhomogeneous Gröbner bases ⋮ Slimgb: Gröbner bases with slim polynomials ⋮ Computation of involutive and Gröbner bases using the tableau representation of polynomials ⋮ Chunky and equal-spaced polynomial multiplication ⋮ Sparse polynomial division using a heap
This page was built for publication: The geobucket data structure for polynomials
