Hiding Cliques for Cryptographic Security
Authors:
- 1 July 2000
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 20 (3) , 269-280
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Finding a large hidden clique in a random graphRandom Structures & Algorithms, 1998
- Cliques, Coloring, and Satisfiability1996
- Coloring Random and Semi-Random k-Colorable GraphsJournal of Algorithms, 1995
- Improved lower bounds for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE1995
- A generalized encryption scheme based on random graphs1992
- Large Cliques Elude the Metropolis ProcessRandom Structures & Algorithms, 1992
- Average case completenessJournal of Computer and System Sciences, 1991
- The solution of some random NP-hard problems in polynomial expected timeJournal of Algorithms, 1989
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- Reducibility among Combinatorial Problems1972