𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degrees of unsolvability associated with Markov algorithms

✍ Scribed by Charles E. Hughes

Publisher
Springer
Year
1972
Tongue
English
Weight
582 KB
Volume
1
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Analysis of greedy algorithms on graphs
Analysis of greedy algorithms on graphs with bounded degrees
✍ Nicholas C. Wormald πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 370 KB

We give a general result on the average-case performance of certain greedy algorithms. These are derived from algorithms in which the possible operations performed at each step are prioritised. This type of prioritisation has occurred in previously studied heuristics for ΓΏnding large subgraphs with

Markov inequality for polynomials of deg
Markov inequality for polynomials of degree n with m distinct zeros
✍ David Benko; TamΓ‘s ErdΓ©lyi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 128 KB

Let P m n be the collection of all polynomials of degree at most n with real coefficients that have at most m distinct complex zeros. We prove that max xA½0;1 jP 0 ðxÞjp32 Á 8 m n max xA½0;1 jPðxÞj for every PAP m n : This is far away from what we expect. We conjecture that the Markov factor 32 Á 8

Asymptotic values for degrees associated
Asymptotic values for degrees associated with strips of young diagrams
✍ Amitai Regev πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 790 KB

The sums S:s'(n) occur in the representations of the symmetric and the general linear groups, in combinatorics and in PI algebras. We give asymptotic values for these sums. '), but a general explicit formula for dim B(I, n) is yet unknown (except for 115