𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Multiple returns under a bounded number of iterations

✍ Scribed by Zbigniew S. Kowalski

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
359 KB
Volume
123
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A bound on the multiplicative efficiency
A bound on the multiplicative efficiency of iteration
✍ H.T. Kung πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 290 KB

For a convergent sequence {xi} generated by xi+l = ~(x~, xt\_ l ,..., Xi\_d+l) , define the multiplicative efficiency measure E to be (log~p)/M, where p is the order of convergence and M is the number of multiplications or divisions needed to compute rp. Then, if 9 is any multivariate rational funct

Bounds on chromatic numbers of multiple
Bounds on chromatic numbers of multiple factors of a complete graph
✍ JΓ‘n PlesnΓ­k πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 306 KB πŸ‘ 1 views

## Abstract Bounds on the sum and product of the chromatic numbers of __n__ factors of a complete graph of order __p__ are shown to exist. The well‐known theorem of Nordhaus and Gaddum solves the problem for __n__ = 2. Strict lower and some upper bounds for any __n__ and strict upper bounds for __n