### Table 1: Reiter { Time Complexity.

"... In PAGE 12: ... Recall that in a given scenario m denotes the number of facts of a situation, n the length of the given action sequence, and k the number of action descriptions. By comparing Table1 and Table 2 we nd that the there is no scenario, where the time complexity OR = O(m n k) of Reiter apos;s approach is smaller than the time complexity Oelp = O(m + n k) of the equational logic approach. But there are scenarios where the time complexity of the equational logic approach is strictly smaller than the time complexity of Reiter apos;s approach.... ..."

### Table 5: Breakdown of Time Complexities.

1998

"... In PAGE 17: ... First, the maximum time required to execute every operation of type p is derived (Tp = op np). Table5 gives a breakdown of time complexities, organized according to algorithm steps. The time complexity of a step is equal to the product of its cost per iteration and the number of iterations it needs.... In PAGE 17: ... B.1 Fuzzy ART (FA): In Table5 , the breakdown of time complexities shows that operation B, the computation of the output neuron choice functions, is potentially the most costly with FA. The sequence 4A similar type of analysis has been conducted by Lawrence et al.... ..."

Cited by 1

### TABLE 1: STATIC SYSTEM PERFORMANCES OF APPLYING PROCESSOR ALLOCATION ON A 30X30 MESH SYSTEM. Request

### Table 1: time complexity analysis

in Abstract in

1993

"... In PAGE 5: ... 4.1 Algorithm Time Complexity Analysis Table1 shows the theoretical complexity analysis for the ten algorithms we implemented on top of our framework.... In PAGE 8: ...times speedup on a dual processor on up to 54 times speedup on 64 cores. These results are in line with the complexity analysis in Table1 . We note that the speedups achieved here involved no special optimizations of the algorithms themselves.... ..."

Cited by 1

### Table 1: time complexity analysis

"... In PAGE 5: ... 4.1 Algorithm Time Complexity Analysis Table1 shows the theoretical complexity analysis for the ten algorithms we implemented on top of our framework.... In PAGE 8: ...times speedup on a dual processor on up to 54 times speedup on 64 cores. These results are in line with the complexity analysis in Table1 . We note that the speedups achieved here involved no special optimizations of the algorithms themselves.... ..."

### TABLE I TIME COMPLEXITY:DUAL-HOMINGPROTECTIONALGORITHMS. Algorithm Time Complexity

### Table 2. Time Complexity Comparison

"... In PAGE 7: ... Since many relational operations are processed in parallel, and if r different operations are required for the same data set, the effective speed up of the system would increase by a factor of r. Table2 compares the execution complexity for each of the relational operations for various architectures. The systems compared include a serial processor, a single-comparand CAM-based processor, and a MW- OCAPP.... ..."

### Table 1 Problems Time complexity

Cited by 3

### TABLE IV TIME COMPLEXITY OF THE ALGORITHMS

2004

Cited by 2

### Table 1: Overview of Time Complexities

1998

Cited by 1