Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. N. Alon and N. Kahale, A spectral technique for coloring random 3 colorable graphs (extended abstract), in: Annual ACM Symposium on Theory of Computing '94, to appear.
2. B. Bollobás, The chromatic number of random graphs, Combinatorica 8, 49–56.
3. Eigenvalues and graph bisection: An average case analysis;Boppana,1987
4. A measure of asymptotic efficiency for tests based on the sum of observations;Chernoff;Ann. Math. Statist.,1952
5. The solution of some random NP-hard problems in polynomial expected time;Dyer;J. Algorithms,1989
Cited by
83 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The landscape of the planted clique problem: Dense subgraphs and the overlap gap property;The Annals of Applied Probability;2024-08-01
2. Planted Clique Conjectures Are Equivalent;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Planted Bipartite Graph Detection;IEEE Transactions on Information Theory;2024-06
4. How to Hide a Clique?;Theory of Computing Systems;2024-04-05
5. Detecting a Planted Bipartite Graph;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25