Borel oracles. An analytical approach to constant-time algorithms

Details Borel oracles. An analytical approach to constant-time algorithms Borel oracles. An analytical approach to constant-time algorithms

2009-07-10

arxiv.org/abs/0907.1805v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Borel oracles. An analytical approach to constant-time algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Borel oracles. An analytical approach to constant-time algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Borel oracles. An analytical approach to constant-time algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-164701