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

One-Way Communication Complexity of Computing a Collection of Rational Functions

โœ Scribed by Zhi-Quan Luo

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
773 KB
Volume
10
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a sequence of rational functions
On a sequence of rational functions
โœ Jean-Paul Allouche ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB
On the complexity of online computations
On the complexity of online computations of real functions
โœ Klaus Weihrauch ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 813 KB

A reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, 1, and -1 for the real numbers and Turing machines which transform with one-way output modified binary input sequences into modified binary output sequences