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

Deciding polynomial-transcendental problems

โœ Scribed by Scott McCallum; Volker Weispfenning

Book ID
113756507
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
318 KB
Volume
47
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Deciding Subsumption Problems
On Deciding Subsumption Problems
โœ Uwe Egly; Reinhard Pichler; Stefan Woltran ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 335 KB
On deciding subsumption problems
On deciding subsumption problems
โœ Uwe Egly; Reinhard Pichler; Stefan Woltran ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 362 KB
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.