203 citations · 391 across the 22 of their papers we have counts for
5 papers · 1 filter
Constructing Minimal Perfect Hash Functions Using SAT Technology
Sean Weaver, Marijn Heule
Minimal perfect hash functions (MPHFs) are used to provide efficient access to values of large dictionaries (sets of key-value pairs). Discovering new algorithms for building MPHFs…
The Resolution of Keller's Conjecture
Joshua Brakensiek, Marijn Heule, John Mackey +1
We consider three graphs, , , and , related to Keller's conjecture in dimension 7. The conjecture is false for this dimension if and only if at least one…
Trimming Graphs Using Clausal Proof Optimization
Marijn J. H. Heule
We present a method to gradually compute a smaller and smaller unsatisfiable core of a propositional formula by minimizing proofs of unsatisfiability. The goal is to compute a mini…
New ways to multiply 3 x 3-matrices
Marijn J. H. Heule, Manuel Kauers, Martina Seidl
It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 x 3-matrices. It is not known whether this can also be done with fe…
Local Search for Fast Matrix Multiplication
Marijn J. H. Heule, Manuel Kauers, Martina Seidl
Laderman discovered a scheme for computing the product of two 3x3 matrices using only 23 multiplications in 1976. Since then, some more such schemes were proposed, but it remains o…