Computer Algebra in Scientific Computing

DOI10.1007/11555964zbMath1169.68660OpenAlexW4300628649MaRDI QIDQ5479235

Yu. A. Blinkov, Vladimir P. Gerdt

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11555964

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (8)

Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets ⋮ A new algorithm for computing staggered linear bases ⋮ Recursive structures in involutive bases theory ⋮ Local algebraic analysis of differential systems ⋮ A general framework for Noetherian well ordered polynomial reductions ⋮ Toward involutive bases over effective rings ⋮ Bar code: a visual representation for finite sets of terms and its applications ⋮ Complementary decompositions of monomial ideals and involutive bases

This page was built for publication: Computer Algebra in Scientific Computing