𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Relations Between Discrete and Continuous Complexity Theory

✍ Scribed by Klaus Meer

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
389 KB
Volume
41
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

A b s t r a c t . Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3-Satisfiability problem. The existence of fast decision procedures for this problem over the reds is examined based on certain conditions on the discrete setting. Moreover we study the behaviour of exponential time computations over the reals depending on the real complexity of 3-Satisfiability. This will be done using tools from complexity theory over the integers.

πŸ“œ SIMILAR VOLUMES

Relations between the continuous and the
Relations between the continuous and the discrete Lotka power function
✍ L Egghe πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 79 KB

## Abstract The discrete Lotka power function describes the number of sources (e.g., authors) with __n__ = 1, 2, 3, … items (e.g., publications). As in econometrics, informetrics theory requires functions of a continuous variable __j__, replacing the discrete variable __n__. Now __j__ represents it

On the relations between continuous and
On the relations between continuous and nonatomic measures
✍ Wolfgang Adamski πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 338 KB

## On the relations between continuous and nonatomic measures By WOLFGANG ADAMSKI of Munchen (Eingegangen am 21. 5. 1979) It is the purpose of this paper to study the relations between continuous and nonatomic (finite, nonnegative, countably additive) measures, where a measure defined on a o-alge

On the metric complexity of continuous-t
On the metric complexity of continuous-time systems
✍ 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