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

Complexity measures and hierarchies for the evaluation of integers and polynomials

โœ Scribed by Richard J. Lipton; David Dobkin

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
363 KB
Volume
3
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The extent and density of sequences with
The extent and density of sequences within the minimal-program complexity hierarchies
โœ R.P. Daley ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 622 KB

In this paper we examine the minimal-program complexity (i.e., the length of a shortest program for computing the initial segments) of recursively enumerable and A S sequences. We determine bounds on the upper and lower extent of these sequences within the complexity hierarchy. Many of these bounds

On the polynomial ฯ„-functions for the KP
On the polynomial ฯ„-functions for the KP hierarchy and the bispectral property
โœ Jorge P. Zubelli ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 317 KB

We show that the z-functions obtained from Schur polynomials lead to wave functions w(x~, x 2 . . . . ;k) that possess the following bispectral property: There exists a differential operator B(k, Ok), independent of xl, such that B(k, #k)W =O(Xl)W, where | is independent of k. This extends for the K