𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On total functions, existence theorems and computational complexity

✍ Scribed by Nimrod Megiddo; Christos H. Papadimitriou

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
895 KB
Volume
81
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational complexity on computable m
Computational complexity on computable metric spaces
✍ Klaus Weirauch πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

## Abstract We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a gene

Uniqueness Theorems on Entire Functions
Uniqueness Theorems on Entire Functions and Their Derivatives
✍ Ping Li; Chung-Chun Yang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 73 KB

This paper studies uniqueness problems on entire functions that share a finite nonzero value counting multiplicities with their derivatives and gives a proper Ž answer to the problem proposed by L. Z. Yang ''Proceedings of the 6th Interna-. tional Colloquium on Complex Analysis, 1998,'' pp. 176᎐183