problemreductions/models/specialized/
mod.rs

1//! Specialized NP-hard problems.
2//!
3//! This module contains problems that don't fit neatly into other categories:
4//! - [`CircuitSAT`]: Boolean circuit satisfiability
5//! - [`Factoring`]: Integer factorization
6//! - [`PaintShop`]: Minimize color switches in paint shop scheduling
7//! - [`BicliqueCover`]: Biclique cover on bipartite graphs
8//! - [`BMF`]: Boolean matrix factorization
9
10mod biclique_cover;
11mod bmf;
12mod circuit;
13mod factoring;
14mod paintshop;
15
16pub use biclique_cover::{is_biclique_cover, BicliqueCover};
17pub use bmf::{boolean_matrix_product, matrix_hamming_distance, BMF};
18pub use circuit::{is_circuit_satisfying, Assignment, BooleanExpr, BooleanOp, Circuit, CircuitSAT};
19pub use factoring::{is_factoring, Factoring};
20pub use paintshop::{count_paint_switches, PaintShop};