Research.
Four directions in algorithms, optimization, and computing.
FourierSAT
Continuous methods for hybrid SAT solving.
View project ↗Quantum computing
Graph constraints, Ising models, and quantum optimization.
View project ↗Visualizing Boolean functions
Global structure and local geometry, made visible.
View project ↗GPU & high-performance computing
CUDA-accelerated algorithms for hard mathematical problems.
View project ↗Open-source tool directory
Open-source tools
FourierSAT ↗
A SAT/MaxSAT solver based on continuous local search for hybrid Boolean constraints.
GradSAT ↗
A C++ extension of FourierSAT that accepts pseudo-Boolean constraints and uses BDDs to accelerate gradient computation.
DPMaxSAT ↗
A dynamic-programming-based C++ solver for generalized MaxSAT problems.
Mixing++ ↗
An accelerated implementation of the Mixing Method based on semidefinite programming.
PMVC ↗
Implementations for perfect-matching graph-decision problems with quantum-computing applications.