✦ LIBER ✦

Structural analysis of the complexity of inverse functions

✍ Scribed by Osamu Watanabe; Seinosuke Toda

Book ID: 105115977
Publisher: Springer
Year: 1993
Tongue: English
Weight: 650 KB
Volume: 26
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01202283

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of subdifferentiation and

The complexity of subdifferentiation and its inverse on convex functions in Banach spaces

✍ Pierre Casevitz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Let E be a separable Banach space with separable dual. We show that the operation of subdi erentiation and the inverse operation are Borel from the convex functions on E into the monotone operators on E (subspace of the closed sets of E × E \* ) for the E ros-Borel structures. We also prove that th

The complexity of partition functions

✍ Andrei Bulatov; Martin Grohe 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 488 KB

Structure/function analysis of peptoid/l

Structure/function analysis of peptoid/lipitoid:DNA complexes

✍ Brian A. Lobo; Joseph A. Vetro; Daniel M. Suich; Ronald N. Zuckermann; C. Russel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 459 KB

Previous transfection studies of cationic peptoid polymers (N-substituted polyglycines) and cationic lipitoid polymers (peptoid-phospholipid conjugates) have shown that only the polymers which possessed a repeating (cationic, hydrophobic, hydrophobic) substituent sequence are efficient in gene trans

Computational complexity of functions

✍ Leonid A. Levin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Semialgebraic complexity of functions

✍ Y. Yomdin 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 437 KB

The complexity of functions on lattices

✍ J.W. Sander; R. Tijdeman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 212 KB

Let f : Z → {0; 1} be a given function. In 1938, Morse and Hedlund observed that if the number of distinct vectors (f(x + 1); : : : ; f(x + n)), x ∈ Z, called complexity, is at most n for some positive integer n, then f is periodic with period at most n. This result is best possible. Functions with