Module specialized 

Specialized NP-hard problems.

This module contains problems that don’t fit neatly into other categories:

• CircuitSAT: Boolean circuit satisfiability
• Factoring: Integer factorization
• PaintShop: Minimize color switches in paint shop scheduling
• BicliqueCover: Biclique cover on bipartite graphs
• BMF: Boolean matrix factorization

Structs

Assignment

An assignment in a circuit: outputs = expr.

BMF

The Boolean Matrix Factorization problem.

BicliqueCover

The Biclique Cover problem.

BooleanExpr

A boolean expression tree.

Circuit

A boolean circuit as a sequence of assignments.

CircuitSAT

The Circuit SAT problem.

Factoring

The Integer Factoring problem.

PaintShop

The Paint Shop problem.

Enums

BooleanOp

Boolean expression node types.

Functions

boolean_matrix_product

Compute the boolean matrix product.

count_paint_switches

Count color switches in a painted sequence.

is_biclique_cover

Check if a biclique configuration covers all edges.

is_circuit_satisfying

Check if a circuit assignment is satisfying.

is_factoring

Check if the given factors correctly factorize the target.

matrix_hamming_distance

Compute the Hamming distance between two boolean matrices.