Computer Algebra in Scientific Computing
From MaRDI portal
Publication:5479243
DOI10.1007/11555964zbMath1169.68663arXivmath-ph/0504048OpenAlexW4300628649MaRDI QIDQ5479243
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math-ph/0504048
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items (4)
Involutive method for computing Gröbner bases over \(\mathbb F_2\) ⋮ Role of involutive criteria in computing Boolean Gröbner bases ⋮ On computation of Boolean involutive bases ⋮ BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
This page was built for publication: Computer Algebra in Scientific Computing