Tiny, zero-dependencies, package which tries to mask sensitive data in arbitrary collections (map, set), errors, objects and strings.

Python implementation of Knuth's Dancing Links (dlx) algorithm to solve set cover. Extremely efficient at solving Sudoku and combinatorial design problems.

Implementation of the *Separate and Conquer* / *Covering*-Algorithm for scikit-learn

Solving the unate and binate set covering problem

Compute arboricity and forest decomposition of graphs.

A simple implementation of the compact ILP formulation for the Set Covering problem

C++ Nonisomorphic Branch-and-Cut

2015 Cimpress Tech Challenge

Given a number of sets with a number of universes,this algorithm finds the least sets with the most universes

🧹 Metadata Cleaner Anti-Forensic — bersihkan jejak digital dari gambar tanpa mengubah kualitas visual, menjaga privasi dan anonimitas digitalmu.

Hypergeometric distribution h(n1,k1,n2,k2). Formula u kodu je standardna hipergeometrijska PMF za tačno k2 pogodaka. Program računa donju granicu pokrivanja (teorijski minimum), broja kombinacija skraćenog sistema (lottery wheel). Sistem od n1 brojeva, kombinacija ima k1 brojeva, izvuče se n2 brojeva, a garancija je k2 pogodaka.