75 citations · 402 across the 82 of their papers we have counts for
4 papers · 1 filter
Symmetries of Dependency Quantified Boolean Formulas
Clemens Hofstadler, Manuel Kauers, Martina Seidl
Symmetries have been exploited successfully within the realms of SAT and QBF to improve solver performance in practical applications and to devise more powerful proof systems. As a…
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…
Short Proofs for Some Symmetric Quantified Boolean Formulas
Manuel Kauers, Martina Seidl
We exploit symmetries to give short proofs for two prominent formula families of QBF proof complexity. On the one hand, we employ symmetry breakers. On the other hand, we enrich th…
Symmetries of Quantified Boolean Formulas
Manuel Kauers, Martina Seidl
While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF).…