Author:
Borgs C.,Chayes J.T.,Lovász L.,Sós V.T.,Vesztergombi K.
Reference31 articles.
1. N. Alon, W. Fernandez de la Vega, R. Kannan, M. Karpinski, Random sampling and approximation of MAX-CSP problems, in: Proc. of the 34th ACM Symp. Theor. of Comp. (STOC), 2002, pp. 232–239
2. Random sampling and approximation of MAX-CSPs;Alon;J. Comput. System Sci.,2003
3. Efficient testing of large graphs;Alon;Combinatorica,2000
4. N. Alon, E. Fischer, I. Newman, A. Shapira, A combinatorial characterization of the testable graph properties: It's all about regularity, in: Proc. of the 38th ACM Symp. Theor. of Comp. (STOC), 2006, pp. 251–260
5. Approximating the cut-norm via Grothendieck's inequality;Alon,2004
Cited by
316 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献