𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact complexity of the logistic map

✍ Scribed by W. -H. Steeb; R. Stoop


Book ID
105574062
Publisher
Springer
Year
1997
Tongue
English
Weight
258 KB
Volume
36
Category
Article
ISSN
0020-7748

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Quantum logistic map
✍ Goggin, M. E.; Sundaram, B.; Milonni, P. W. πŸ“‚ Article πŸ“… 1990 πŸ› The American Physical Society 🌐 English βš– 244 KB
Stable trajectory of logistic map
✍ Li, Chaojie; Zhou, Xiaojun; Gao, David Yang πŸ“‚ Article πŸ“… 2014 πŸ› Springer Netherlands 🌐 English βš– 357 KB
Exact complexity of Exact-Four-Colorabil
✍ JΓΆrg Rothe πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 91 KB

Let M k be a given set of k integers. Define Exact-M k -Colorability to be the problem of determining whether or not Ο‡(G), the chromatic number of a given graph G, equals one of the k elements of the set M k exactly. In 1987, Wagner [Theoret. Comput. Sci. 51 (1987) is the 2kth level of the Boolean