//! Efficient Sparse Polynomial Representation for Gröbner Basis
//!
//! This module provides an optimized polynomial representation using:
//! - HashMap<Monomial, Coefficient> for O(1) term lookup
//! - Efficient monomial ordering for Gröbner basis computation
//! - Optimized arithmetic operations (O(n) addition, O(n²) multiplication)
//!
//! This achieves SymPy-level performance by avoiding Expression tree explosion.
pub use ;
pub use Monomial;
pub use SparsePolynomial;