Random Tensors and Planted Cliques-Reference-Cited by-同舟云学术

Random Tensors and Planted Cliques

Published:2009 Issue: Volume: Page:406-419
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Brubaker S. Charles,Vempala Santosh S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03685-9_31

Reference9 articles.

1. Frieze, A., Kannan, R.: A new approach to the planted clique problem. In: Proc. of FST & TCS (2008)

2. Karp, R.: The probabilistic analysis of some combinatorial search algorithms. In: Algorithms and Complexity: New Directions and Recent Results, pp. 1–19. Academic Press, London (1976)

3. Jerrum, M.: Large cliques elude the metropolis process. Random Structures and Algorithms 3(4), 347–360 (1992)

4. Kucera, L.: Expected complexity of graph partitioning problems. Discrete Applied Mathematics 57, 193–212 (1995)

5. Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Structures and Algorithms 13, 457–466 (1998)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique;ACM Transactions on Algorithms;2018-07-16

2. Spectral Properties of Hypergraph Laplacian and Approximation Algorithms;Journal of the ACM;2018-03-27

3. Weak Decoupling, Polynomial Folds and Approximate Optimization over the Sphere;2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS);2017-10

4. Strongly refuting random CSPs below the spectral threshold;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19

5. Statistical Algorithms and a Lower Bound for Detecting Planted Cliques;Journal of the ACM;2017-06-02