Marijn Heule
| Marijn Heule | |
| Born | March 12, 1979 |
|---|---|
| Residence | Unknown |
| Nationality | Dutch |
| Institutions | Carnegie Mellon University |
| Alma mater | Delft University of Technology |
Marijn Heule is Associate Professor in the Computer Science Department at Carnegie Mellon University, who specializes in solving large combinatorial problems using computer techniques such as SAT solvers. In 2016, Heule solved the Boolean Pythagorean triples problem with a distributed SAT solver, producing a record-breaking 200-terabyte proof of unsatisfiability.
He contributed to the development of several SAT solvers, including lingeling and the lookahead SAT solver march-cc, and adapted the Glucose SAT solver to support incremental CNF input files. The resulting program, iglucose, was further adapted by Tomas Rokicki to be interactively operable through named pipes, allowing it to be used in Adam P. Goucher's knightship search program, ikpx.
Heule also discovered Garden of Eden 6, the smallest symmetric Garden of Eden, in collaboration with Christiaan Hartman, Kees Kwekkeboom, and Alain Noels.[1]
External links
- Marijn Heule's homepage at Carnegie Mellon University
- Everything's Bigger in Texas: an account of how Heule solved the Boolean Pythagorean triples problem.
- ↑ M. Huele et al. "Symmetry in Gardens of Eden". Retrieved on September 6, 2022.