Topic
Average-case complexity
About: Average-case complexity is a research topic. Over the lifetime, 1749 publications have been published within this topic receiving 44972 citations.
Papers published on a yearly basis
Papers
More filters
••
25 Aug 2008TL;DR: Methods for decreasing the computational complexity before executing the iterative estimation algorithms for the estimation of several unknown channel amplitudes and taps in a multipath environment are applied.
Abstract: The estimation of several unknown channel amplitudes and taps in a multipath environment is an important problem when designing receivers both for communication and navigation purposes. A popular approach for these estimation problems are methods solving the maximum likelihood (ML) problem for each dimension separately like the expectation maximization (EM) approach and the more sophisticated space alternating generalized expectation maximization (SAGE) algorithm. However, both methods require a high computational complexity when used in spread spectrum systems due to long spreading sequences. Therefore, we apply methods for decreasing the computational complexity before executing the iterative estimation algorithms. The respective performance is assessed by means of computer simulations for a UMTS scenario which show a negligible degradation in estimation accuracy despite a substantial complexity reduction.
2 citations
••
01 Dec 2002TL;DR: A new efficient optimal greedy algorithm for solving a variant of the matching problem where only matchings that are associated with a given hierarchical structure are allowed.
Abstract: In this paper we present a new efficient optimal greedy algorithm for solving a variant of the matching problem. Here, only matchings that are associated with a given hierarchical structure are allowed. We prove the correctness of the proposed algorithm and analyze its computational complexity.
2 citations
••
10 Sep 2007TL;DR: This is a survey of some of my joint work with Sylvain Perifel on transfer theorems that connect boolean complexity to algebraic complexity in the Valiant and Blum-Shub-Smale models.
Abstract: This is a survey of some of my joint work with Sylvain Perifel. It is focused on transfer theorems that connect boolean complexity to algebraic complexity in the Valiant and Blum-Shub-Smale models.
2 citations
•
TL;DR: Using the two algorithms proposed, the upper bound of the (2-adic) complexity and the k-error 2-adic complexity can be obtained in n steps respectively.
Abstract: In this paper an algorithm for computing the 2-adic complexity of the binary sequence with period N=2~(n) is proposed firstlyBased on which a synthesis algorithm for computing the(k-error)(2-adic) complexity is givenUsing the two algorithms proposed,the upper bound of the(2-adic) complexity and the k-error 2-adic complexity can be obtained in n steps respectively
2 citations