9 citations · 11 across the 2 of their papers we have counts for
2 papers
cs.LO2019★ 2 cited
Formalizing the Solution to the Cap Set Problem
Sander R. Dahmen, Johannes Hölzl, Robert Y. Lewis
In 2016, Ellenberg and Gijswijt established a new upper bound on the size of subsets of with no three-term arithmetic progression. This problem has received much m…
cs.LO2012★ 9 cited
Interactive verification of Markov chains: Two distributed protocol case studies
Johannes Hölzl, Tobias Nipkow
Probabilistic model checkers like PRISM only check probabilistic systems of a fixed size. To guarantee the desired properties for an arbitrary size, mathematical analysis is necess…