Struct CommunicationMatrixAnalyzer 

pub struct CommunicationMatrixAnalyzer {
    pub matrix: Vec<Vec<u8>>,
}

Compute rank-based lower bounds for communication complexity. Uses Gaussian elimination over GF(2) to find rank of the communication matrix.

Fields

matrix: Vec<Vec<u8>>

rows × cols matrix over GF(2)

Implementations

impl CommunicationMatrixAnalyzer

pub fn new(matrix: Vec<Vec<u8>>) -> Self

Create from a matrix (entries should be 0 or 1).

pub fn rank_gf2(&self) -> usize

Compute the GF(2) rank of the matrix.

pub fn log_rank_lower_bound(&self) -> usize

Log2 rank lower bound on deterministic communication complexity. Returns floor(log2(r)) where r is the GF(2) rank.