Author:
Alon Noga,de la Vega W.Fernandez,Kannan Ravi,Karpinski Marek
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference16 articles.
1. On the discrepancy of combinatorial rectangles;Alon;Random Structures Algorithms,2002
2. N. Alon, W. Fernandez-de-la-Vega, R. Kannan, M. Karpinski, Random sampling and approximation of MAX-CSP problems, in: Proceedings of the 34th ACM STOC, ACM, New York, 2002, pp. 232–239.
3. N. Alon, A. Shapira, Testing satisfiability, in: Proceedings of the 13th Annual ACM-SIAM SODA, ACM, New York, 2002, pp. 645–654.
4. G. Andersson, L. Engebretsen, Sampling methods applied to dense instances of non-Boolean optimization problems, in: Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, Barcelona, October 1998, LNCS, Vol. 1017, Springer, Berlin, 1998, pp. 357–368.
5. Property testers for dense constraint satisfaction programs on finite domains;Andersson;Random Structures Algorithms,2002
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Pliability and Approximating Max-CSPs;Journal of the ACM;2023-11-30
2. Local and Global Expansion in Random Geometric Graphs;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Streaming Euclidean Max-Cut: Dimension vs Data Reduction;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Testing Cluster Properties of Signed Graphs;Proceedings of the ACM Web Conference 2023;2023-04-30
5. Hypergraph regularity and random sampling;Random Structures & Algorithms;2023-03