Struct BMF 

pub struct BMF { /* private fields */ }

The Boolean Matrix Factorization problem.

Given an m×n boolean matrix A and rank k, find:

• B: m×k boolean matrix
• C: k×n boolean matrix

Such that the Hamming distance between A and B⊙C is minimized.

Example

use problemreductions::models::specialized::BMF;
use problemreductions::{Problem, Solver, BruteForce};

// 2x2 identity matrix
let a = vec![
    vec![true, false],
    vec![false, true],
];
let problem = BMF::new(a, 1);

let solver = BruteForce::new();
let solutions = solver.find_best(&problem);

// Check the error
for sol in &solutions {
    let error = problem.solution_size(sol).size;
    println!("Hamming error: {}", error);
}

Implementations

impl BMF

pub fn new(matrix: Vec<Vec<bool>>, k: usize) -> Self

Create a new BMF problem.

Arguments

• matrix - The target m×n boolean matrix
• k - The factorization rank

pub fn rows(&self) -> usize

Get the number of rows.

pub fn cols(&self) -> usize

Get the number of columns.

pub fn rank(&self) -> usize

Get the factorization rank.

pub fn matrix(&self) -> &[Vec<bool>]

Get the target matrix.

pub fn extract_factors( &self, config: &[usize], ) -> (Vec<Vec<bool>>, Vec<Vec<bool>>)

Extract matrices B and C from a configuration.

Config layout: first mk bits are B (row-major), next kn bits are C (row-major).

pub fn boolean_product(b: &[Vec<bool>], c: &[Vec<bool>]) -> Vec<Vec<bool>>

Compute the boolean product B ⊙ C.

(B ⊙ C)[i,j] = OR_k (B[i,k] AND C[k,j])

pub fn hamming_distance(&self, config: &[usize]) -> usize

Compute the Hamming distance between the target and the product.

pub fn is_exact(&self, config: &[usize]) -> bool

Check if the factorization is exact (Hamming distance = 0).

Trait Implementations

impl Clone for BMF

fn clone(&self) -> BMF

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for BMF

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for BMF

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for BMF

const NAME: &'static str = "BMF"

Base name of this problem type (e.g., “IndependentSet”).

type GraphType = SimpleGraph

The graph type this problem operates on.

type Weight = i32

The weight type for this problem.

type Size = i32

The type used for objective/size values.

fn num_variables(&self) -> usize

Returns the number of variables in the problem.

fn num_flavors(&self) -> usize

Returns the number of possible values (flavors) for each variable. For binary problems, this is 2.

fn problem_size(&self) -> ProblemSize

Returns metadata about the problem size.

fn energy_mode(&self) -> EnergyMode

Returns whether larger or smaller objective values are better.

fn solution_size(&self, config: &[usize]) -> SolutionSize<Self::Size>

Evaluate the solution size for a given configuration.

fn variables(&self) -> Range<usize>

Returns the range of variable indices.

fn flavors(&self) -> Vec<usize>

Returns the possible flavors as a vector.

fn is_valid_config(&self, config: &[usize]) -> bool

Check if a configuration is valid for this problem.

fn solution_size_multiple( &self, configs: &[Vec<usize>], ) -> Vec<SolutionSize<Self::Size>>

Evaluate multiple configurations at once (batch evaluation).

impl Serialize for BMF

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.