### Table 1. Map Complexity

1982

Cited by 1

### Table 4. Rank Correlation of Effectiveness with Judged Complexity of the Mapped Distribution

1982

Cited by 1

### Table 3: Complexity of instantaneous MAP decoder

"... In PAGE 3: ...), S2+S multiplications, S2- S additions, and S-1 comparisons per unit time, where S is the number of data rates. The complexity in terms of memory locations, multiplications, additions and comparisons is given Table3 for different data rate cases. If we consider each multiplication, addition or comparison as one operation, the required operations are 35 for four data rates or S=4.... ..."

### TABLE IV: COMPLEXITY OF LOG-MAP ALGORITHM

### TABLE I REDUCTION OF COMPLEXITY FOR SEVERAL MAPS

### Table 3: Geometric and shading complexity, shadow map resolution and construction time

"... In PAGE 8: ... In addition, Figure 4 shows the fast growth rate of the error of PCF based soft shadows with respect to light radius; in contrast, the error curve of ray traced MTSM shadows is almost flat with respect to light radius. Figure 4: Error growth of PCF based shadows and ray traced MLSM shadows for Shrek Table 2 shows the performance comparison for the differ- ent soft shadow methods (the numbers only include shadow computation time during shading) and Table3 shows the ge- ometric and shading complexity of each test as well as the resolution and construction cost of the shadow maps used. For regular geometry (Shrek and palm tree), ray tracing multiview shadow maps produces high quality soft shadows.... ..."

### Table 4.1. Computational Complexity of Schema Mapping

1997

Cited by 3

### Table 3. Mapping from complex to real operations.

2005

### Table 8: Simpli ed map of the complexity of SAS plan generation.

1998

"... In PAGE 54: ... By inspecting the lattice more closely, we can provide a simple character- ization of when the problems are tractable and intractable, respectively. The simpli ed presentation is shown in Table8 . We see that if an instance does not satisfy the I and A? restrictions, then we cannot solve it in polynomial time with any of the methods presented here.... ..."

Cited by 18