𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of iterated shuffle

✍ Scribed by Manfred K. Warmuth; David Haussler

Book ID
103157958
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
950 KB
Volume
28
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the iterated complex transfer
On the iterated complex transfer
✍ A. Baker; D. Carlisle; B. Gray; S. Hilditch; N. Ray; R. Wood πŸ“‚ Article πŸ“… 1988 πŸ› Springer-Verlag 🌐 French βš– 631 KB
Finite Field Towers: Iterated Presentati
Finite Field Towers: Iterated Presentation and Complexity of Arithmetic
✍ Valentine B. Afanassiev; Alexander A. Davydov πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 162 KB

Finite "eld towers GF(q.) are considered, where P"p L p L 2 p LR R and all primes p G are distinct factors of (q!1). Under this condition irreducible binomials of the form x.!c can be used for recursive extension of "nite "elds. We give description of an in"nite sequence of irreducible binomials, ne

The quantifier complexity of polynomial-
The quantifier complexity of polynomial-size iterated definitions in first-order logic
✍ Samuel R. Buss; Alan S. Johnson πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 208 KB

## Abstract We refine the constructions of Ferrante‐Rackoff and Solovay on iterated definitions in first‐order logic and their expressibility with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite set