### Table 6.2: Input-output complexity of computing interconnection queries. D is always assumed to conform to S. If S is a tree, the complexity is always polynomial in D and the output.

2004

Cited by 2

### Table A.1: 1D Real-to-complex FFT, normal output.

### Table A.8: 2D real-to-complex FFT, normal output.

### Table 3.1: Feature filters implemented in MBSIS. name input 1 input 2 output complexity

### Table 3.2: Feature filters (selectors) implemented in MBSIS. name input 1 input 2 output complexity

### TABLE I Delay and complexity of the soft-input soft-output modules

### Table A.9: 2D real-to-complex FFT, bit-reversed output.

### Table 2: Complexities of TMD Attack for n = 128, k = 64 and Different Output Size m with Emphasis on Low Attack Complexity

in Abstract

2007

"... In PAGE 16: ... In Table 1, we list the size of the reduced search space for different output size. In Table2 , we list the pre-processing and attack complexities of TMD attack for different amount of memory and keystream. Here we fix the number of ciphertext required as 216 and concentrate on achieving a low attack complexity.... ..."

### Table 1 Number of complex multiplications per output sample in FMT systems with 64, 128 and 256 subchannels and different values of the overlap parameter

2002

"... In PAGE 29: ... 10. In Table1 we show the number of operations to compute each output of x(n) for both the direct and the efficient implementation. We will consider that the inputs are complex numbers.... ..."