We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved f
The (n, k)-bounded emptiness-problem for probabilistic acceptors and related problems
โ Scribed by Volker Claus
- Publisher
- Springer-Verlag
- Year
- 1981
- Tongue
- English
- Weight
- 942 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper is concerned with usual decidability questions on grammars for some classes of categorial grammars that arise in the field of learning categorial grammars. We prove that the emptiness of intersection of two langages is an undecidable problem for the following classes : k-valued classical
We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we
## Abstract The Dirichlet problems for the Stokes resolvent equations are studied from the point of view of the theory of hydrodynamic potentials. Existence and uniqueness results as well as boundary integral representations of classical solutions are given for domains having compact but not connec