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 cert
Relation between continuous and discrete time markovian decision problems
β Scribed by Prasadarao Kakumanu
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 471 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
A general formulation for discrete-time quantum mechanics, based on Feynman's method in ordinary quantum mechanics, is presented. It is shown that the ambiguities present in ordinary quantum mechanics (due to noncommutativity of the operators), are no longer present here. Then the criteria for the u