Borel oracles. An analytical approach to constant-time algorithms
暂无分享,去创建一个
[1] Alexander S. Kechris,et al. Topics in orbit equivalence , 2004 .
[2] Miklós Laczkovich,et al. Closed sets without measurable matching , 1988 .
[3] Ronitt Rubinfeld,et al. Sublinear Time Algorithms , 2011, SIAM J. Discret. Math..
[4] D. Aldous,et al. Processes on Unimodular Random Networks , 2006, math/0603062.
[5] Stevo Todorcevic,et al. BOREL CHROMATIC NUMBERS , 1999 .
[6] G. Elek. Parameter testing in bounded degree graphs of subexponential growth , 2010 .
[7] I. Benjamini,et al. Recurrence of Distributional Limits of Finite Planar Graphs , 2000, math/0011019.
[8] Béla Bollobás,et al. The independence ratio of regular graphs , 1981 .
[9] Kenji Obata,et al. A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[10] R. Häggkvist,et al. Bipartite graphs and their applications , 1998 .
[11] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[12] Gábor Elek,et al. Parameter testing in bounded degree graphs of subexponential growth , 2007, Random Struct. Algorithms.