5 citations · 8 across the 14 of their papers we have counts for
Showing 2026 · cs.LOShow all
2 papers · 2 filters
cs.LO2026
Coloring Queens with Thousands of Encodings
Bernardo Subercaseaux, Benjamin Przybocki, Marijn J. H. Heule
In The Art of Computer Programming, Knuth benchmarked 10 encoding techniques for computing the chromatic number of the queen's graph: the minimum number of colors needed to color t…
cs.LO2026
Bringing closure to theory combination properties
Guilherme V. Toledo, Benjamin Przybocki, Yoni Zohar
We consider the closure of three classical combination properties, namely, stable infiniteness, gentleness and shininess (or, equivalently for decidable theories, strong politeness…