The solution of some random NP-hard problems in polynomial expected time
- 1 December 1989
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 10 (4) , 451-489
- https://doi.org/10.1016/0196-6774(89)90001-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Pseudo-Random GraphsPublished by Elsevier ,1987
- On the complexity of partitioning graphs into connected subgraphsDiscrete Applied Mathematics, 1985
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963