The problem in question is that of nding a large clique in a random graph While the largest clique in a ran dom graph is ery lik ely to b e of size ab out 2 log it is widely conjectured that no p olynomialti me algorithm exists whic h nds a clique o ID: 67793
Download Pdf The PPT/PDF document "Hiding Cliques for Cryptographic Securit..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
