Borel oracles. An analytical approach to constant-time algorithms
Combinatorics
2009-07-13 v1 General Topology
Abstract
Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs. The Borel oracle machinery is a tool that can be used to convert some statements in Borel graph theory to theorems in the field of constant-time algorithms. In this paper we illustrate the power of this tool to prove the existence of the above mentioned constant-time approximation algorithm.
Cite
@article{arxiv.0907.1805,
title = {Borel oracles. An analytical approach to constant-time algorithms},
author = {Gabor Elek and Gabor Lippner},
journal= {arXiv preprint arXiv:0907.1805},
year = {2009}
}