boolean-functions

Interpreters and Boolean program generators for 81 esoteric languages.

A toolkit for teaching, learning, and doing research in Boolean function analysis. Fourier analysis, property testing, query complexity, hypercontractivity, pseudorandomness, and more

Deterministic Deutsch-Jozsa quantum algorithm solver distinguishing constant vs balanced Boolean black-box functions in an exact single query with 0-pip Python.

Deterministic Deutsch-Jozsa quantum algorithm solver distinguishing constant vs balanced Boolean black-box functions in an exact single query with 0-pip Python.

A collection of utility functions to apply boolean logic on functions (including higher-order). Written (and can be used) in a functional programming style.

Windows 桌面工具：分析单输出与多输出布尔函数，支持真值表、ANF 导入及密码学指标计算。

Python package implemeted in Rust to compute the algebraic immunity and restricted algebraic immunity of a Boolean function

GF(2) Möbius / zeta transform in o(N log N) XOR gates, the first asymptotic improvement over Yates (1937) for circuits with cancellation: proofs, certificates, Lean 4 checks, and closed ideas. Asymptotic only, AI-checked, not yet human-refereed.

Computer-Assisted Resolution of the Direct Product Conjecture via Kullback-Leibler (KL) Divergence Information Tensorization and Pinsker-Bounded Simulation Operators. (Cloud Security)

An esoteric programming language to play around and create boolean functions while being strictly limited to operations involving NAND gates.

A tool for working with Boolean functions and sets

Generic Interactions To Specific Boolean Equations

CL-DIAG: Diagnosing canonicalization leakage in supervised learning under group symmetry

🧮 Also known as the Quine-McCluskey method

Data analyses related to Truth Density bias in commonly used Boolean Regulatory Functions

Prediction-calibrated analytic bounds with an application to exact Boolean formula complexity.

Beamer talk on Boolean functions, coding theory, and quantum error correction

Exact minimal integer-weight threshold circuits for every 4-input Boolean function (65,536 tables, 222 NPN classes): free-weight optima, capped Pareto frontiers, constructive forms, price of decomposability - all machine-verified.