Improved time and space bounds for Boolean matrix multiplication
โ Scribed by Leonard Adleman; Kellogg S. Booth; Franco P. Preparata; Walter L. Ruzzo
- Publisher
- Springer-Verlag
- Year
- 1978
- Tongue
- English
- Weight
- 534 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on -splitting subspaces of f
## Abstract The space and time uncertainties are evaluated by using the quantum mechanical spacetime description. It is proved that it is not the total uncertainty contribution which has to be interpreted as a whole, but rather the distinct uncertainty contributions which possess a welldefined phys