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.

Solving the unate and binate set covering problem

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

Compute arboricity and forest decomposition of graphs.

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

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

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

2015 Cimpress Tech Challenge

C++ Nonisomorphic Branch-and-Cut

A single-sheet visual reference covering everything you need when building AI agent systems — from loop anatomy and architecture patterns to tool schema syntax, prompt engineering formulas, model selection, and a debug checklist. Designed to live on your desk and cut context-switching during development. Print at A3 or tile across two Letter pages.