𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Time Complexity of Partial Real Functions

✍ Scribed by Armin Hemmerling


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
143 KB
Volume
16
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the metric complexity of continuous-t
✍ Le Yi Wang; Lin Lin πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 531 KB

In this paper, metric complexities of certain classes of continuous-time systems are studied, using the time-domain sampling approach and the concepts of Kolmogorov, Gel'fand and sampling n-widths for certain classes of Sobolev space. A sampling theorem is obtained which extends Shannon's sampling t

The Complexity of McNaughton Functions o
✍ Stefano Aguzzoli πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 236 KB

McNaughton functions play the same role in Łukasiewicz logics as Boolean functions do in classical logic. Formulas in one variable are an important ingredient of automated deduction in many-valued logics: the aim of this paper is to establish some results on the complexity of the problems of functio

Composition operators on spaces of real
✍ PaweΕ‚ DomaΕ„ski; Michael Langenbruch πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 259 KB πŸ‘ 1 views

Let Ω1, Ω2 be open subsets of R d 1 and R d 2 , respectively, and let A(Ω1) denote the space of real analytic functions on Ω1. We prove a Glaeser type theorem by characterizing when a composition operator CΟ• : Using this result we characterize when A(Ω1) can be embedded topologically into A(Ω2) as

Single-Shot Experiments for the Acquisit
✍ Burkhard Luy; Steffen J. Glaser πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 82 KB

Simple pulse sequences are introduced that make it possible to acquire experimental Hartmann-Hahn transfer functions for arbitrary multiple-pulse sequences in a single shot. With this approach it is possible to study the detailed dependence of coherence-transfer functions on experimental parameters

On-Line Routing of Real-Time Messages
✍ Joseph Y-T. Leung; Tommy W. Tam; Gilbert H. Young πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 231 KB

The problem of routing unit-length, real-time messages in a distributed system is considered. An on-line routing algorithm is one that routes messages without any knowledge of future arrivals of messages. An on-line algorithm is said to be optimal if it produces a feasible route whenever one exists.

On neighborhoods of analytic functions w
✍ Janusz SokΓ³ πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 95 KB

## Abstract Let __h__(__z__) = __z__ + __a__~2~__z__^2^ + β‹…β‹…β‹… be analytic in the unit disc \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\cal U}$\end{document} on the complex plane \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {