mathhook_core/core/polynomial/
sparse_polynomial.rs

1//! Efficient Sparse Polynomial Representation for Gröbner Basis
2//!
3//! This module provides an optimized polynomial representation using:
4//! - HashMap<Monomial, Coefficient> for O(1) term lookup
5//! - Efficient monomial ordering for Gröbner basis computation
6//! - Optimized arithmetic operations (O(n) addition, O(n²) multiplication)
7//!
8//! This achieves SymPy-level performance by avoiding Expression tree explosion.
9
10mod conversion;
11mod monomial;
12mod polynomial;
13
14pub use conversion::{expression_to_sparse_polynomial, sparse_polynomial_to_expression};
15pub use monomial::Monomial;
16pub use polynomial::SparsePolynomial;