### Table2. Complexity classes of automata with logarithmically space-bounded tape and empty alternation

1994

"... In PAGE 5: ... In the following, for X 2 fLOG, PDA{TIME(pol), PDA, P, PSPACEg and a function g, where we again admit the cases that g is a constant or that g is unbounded, let EA log g X denote the set of all languages recognized by logspace Turing machines augmented with storage of type X, which make g(n) 1 empty alternations. The main results of this chapter are collected in Table2 , which is the \empty quot; analogue of Table 1. 3.... ..."

Cited by 2

### Table 1.1: Space bounds and operations supported for our data structures. Structures that are marked as semidynamic have space bounds that depend on the locality of a vertex labeling (see Section 5.2 for details).

2005

Cited by 2

### Table 1.1: Space bounds and operations supported for our data structures. Structures that are marked as semidynamic have space bounds that depend on the locality of a vertex labeling (see Section 5.2 for details).

2005

Cited by 2

### Table 1: Upper bounds on the Kolmogorov complexity of the Bible, as translated into thirteen languages; computed by the bzip2 compression algorithm.

### Table 3 The computation complexity of color feature extraction.

"... In PAGE 11: ... Color moments were extracted only from the 333 neighborhood of the salient points and a small number of salient points were used. Table3 summarizes the computational gain of color feature extraction for the same three databases used in Table 2. As one can see, the computational gain is very large for the salient approach compared to the global ap- proach.... ..."

### Table III. Complexity of some programs and their extracted modules

1994

Cited by 6

### Table IV. Module complexity before and after extraction

1994

Cited by 6