most citedMoser-Tardos Algorithm with small number of random bits

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing math.MGShow all

1 paper · 1 filter

math.MG2025

Circle Squaring with Pieces of Small Boundary and Low Borel Complexity

András Máthé, Jonathan A. Noel, Oleg Pikhurko

Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in the plane into finitely many pieces and reassemble them via isometries to yield a part…