Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms

P. Duhamel

doi:10.1109/29.60070

Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms

IEEE Transactions on Acoustics Speech and Signal Processing ◽

10.1109/29.60070 ◽

1990 ◽

Vol 38 (9) ◽

pp. 1504-1511 ◽

Cited By ~ 32

Author(s):

P. Duhamel

Keyword(s):

Lower Bounds ◽

Multiplicative Complexity ◽

Practical Algorithms

Download Full-text

Lower bounds for the multiplicative complexity of matrix multiplication

Computational Complexity ◽

10.1007/s000370050028 ◽

1999 ◽

Vol 8 (3) ◽

pp. 203-226 ◽

Cited By ~ 13

Author(s):

M. Bläser

Keyword(s):

Lower Bounds ◽

Matrix Multiplication ◽

Multiplicative Complexity

Download Full-text

Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs

IEEE Transactions on Knowledge and Data Engineering ◽

10.1109/tkde.2007.1008 ◽

2007 ◽

Vol 19 (5) ◽

pp. 585-598 ◽

Cited By ~ 10

Author(s):

Daniel Fogaras ◽

Balazs Racz

Keyword(s):

Lower Bounds ◽

Similarity Search ◽

Practical Algorithms ◽

Massive Graphs

Download Full-text

A detailed comparative analysis of all practical algorithms to compute lower bounds on the structured singular value

Control Engineering Practice ◽

10.1016/j.conengprac.2015.06.006 ◽

2015 ◽

Vol 44 ◽

pp. 219-230 ◽

Cited By ~ 5

Author(s):

C. Roos ◽

J.-M. Biannic

Keyword(s):

Comparative Analysis ◽

Lower Bounds ◽

Singular Value ◽

Structured Singular Value ◽

Practical Algorithms

Download Full-text

Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits

RAIRO - Theoretical Informatics and Applications ◽

10.1051/ita:2001120 ◽

2001 ◽

Vol 35 (3) ◽

pp. 277-286 ◽

Cited By ~ 7

Author(s):

Jan Johannsen

Keyword(s):

Lower Bounds

Download Full-text

Lower Bounds in Communication Complexity

10.1561/9781601982599 ◽

2007 ◽

Author(s):

T. Lee ◽

A. Shraibman

Keyword(s):

Lower Bounds ◽

Communication Complexity

Download Full-text

Lower Bounds on the Aperiodic Hamming Correlations of Frequency Hopping Sequences

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e96.a.1445 ◽

2013 ◽

Vol E96.A (6) ◽

pp. 1445-1450 ◽

Cited By ~ 3

Author(s):

Xing LIU ◽

Daiyuan PENG ◽

Xianhua NIU ◽

Fang LIU

Keyword(s):

Lower Bounds ◽

Frequency Hopping ◽

Frequency Hopping Sequences

Download Full-text

Two Lower Bounds for Shortest Double-Base Number System

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e98.a.1310 ◽

2015 ◽

Vol E98.A (6) ◽

pp. 1310-1312 ◽

Cited By ~ 2

Author(s):

Parinya CHALERMSOOK ◽

Hiroshi IMAI ◽

Vorapong SUPPAKITPAISARN

Keyword(s):

Lower Bounds ◽

Number System ◽

Base Number ◽

Double Base

Download Full-text

Lower bounds on the dimension of the Rauzy gasket

Bulletin de la Société mathématique de France ◽

10.24033/bsmf.2807 ◽

2020 ◽

Vol 148 (2) ◽

pp. 321-327

Author(s):

Rodolfo Gutiérrez-Romo ◽

Carlos Matheus

Keyword(s):

Lower Bounds

Download Full-text

Lower Bounds and Flat Graphs of Precedence Relations for the Resource-Constrained Project Scheduling Problem

13th IFAC Symposium on Information Control Problems in Manufacturing ◽

10.3182/20090603-3-ru-2001.00253 ◽

2009 ◽

Author(s):

Lazarev, Alexander

Keyword(s):

Lower Bounds ◽

Project Scheduling ◽

Scheduling Problem ◽

Resource Constrained ◽

Resource Constrained Project Scheduling ◽

Precedence Relations ◽

Project Scheduling Problem

Download Full-text

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

The Electronic Journal of Combinatorics ◽

10.37236/1188 ◽

1994 ◽

Vol 1 (1) ◽

Cited By ~ 8

Author(s):

Geoffrey Exoo

Keyword(s):

Lower Bound ◽

Lower Bounds ◽

Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

Download Full-text