๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Handling Expected Polynomial-Time Strategies in

โœ Scribed by Jonathan Katz; Yehuda Lindell

Book ID
105839891
Publisher
Springer
Year
2007
Tongue
English
Weight
602 KB
Volume
21
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Deciding k-colorability in expected poly
Deciding k-colorability in expected polynomial time
โœ Michael Krivelevich ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 79 KB

For every fixed k 3 we describe an algorithm for deciding k-colorability, whose expected running time in polynomial in the probability space G(n, p) of random graphs as long as the edge probability p = p(n) satisfies p(n) C/n, with C = C(k) being a sufficiently large constant.