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
24 Mar 2008
TL;DR: In this paper, different notational complexities and their paradigms are studied from the new perspectives and simplified and consistent approaches are introduced that will make the analysis even simpler and easier to follow.
Abstract: There exists a variety of techniques for the computational complexity analysis of algorithms and functions. This analysis is imperative to the algorithmic and the functional performance. Besides the big-oh complexity, there are other complexity notations, such as Ω, Θ, small o and small ω notational complexities. Complexity analysis is used to select an appropriate algorithm for solving a given problem using computer. Unfortunately, most of the prevailing approaches lack in simplicity and consistency. Existing techniques are complex, and rather difficult to practice in applications. There is a trend to exploit the notational complexities in the existing literature by treating those as functions instead of sets. In this paper, different notational complexities and their paradigms are studied from the new perspectives. Simplified and consistent approaches are introduced that will make the analysis even simpler and easier to follow. Abused notational complexities are analyzed through the appropriate approach.
01 Aug 2015
TL;DR: A genetic algorithm is designed to generate the N-periodic q-ary excellent sequences, where N=27, 81, , 2187, and get some laws of k-error linear complexity and linear complexity.
Abstract: The pn-periodic q-ary sequence with high linear complexity and high k-error linear complexity is defined as excellent sequence. With appropriate fitness function and parameters, this paper design a genetic algorithm to generate the N-periodic q-ary excellent sequences, where N=27, 81, , 2187, and get some laws of k-error linear complexity and linear complexity, here p is an odd prime and q is a primitive root modulo p2.
01 Jan 2009
TL;DR: A chronology of key events and quotes from the first chapter of “The Art of War” can be found here.
Abstract: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 CHAPTER
26 Aug 2001
TL;DR: This paper proposes an algorithm for proportional knowledge base revision and it is shown that the computational complexity is connected with the relationship between the number of formulas and theNumber of variables.
Abstract: Propositional knowledge base revision in intractable in the general case. This paper proposes an algorithm for proportional knowledge base revision. It is shown that the computational complexity is connected with the relationship between the number of formulas and the number of variables. A sufficient condition is provided to guarantee the algorithm is polynomial.
01 Dec 2011
TL;DR: A unified tree-search detection scheme based on Dijkstra's algorithm for MIMO systems is developed by allowing the memory usage, detection complexity, and sorting dynamic associated with the algorithm to be customized.
Abstract: A unified tree-search detection scheme based on Dijkstra's algorithm is developed for MIMO systems. The proposed framework generalizes the original Dijkstra's algorithm by allowing the memory usage, detection complexity, and sorting dynamic associated with the algorithm to be customized. By tuning different parameters, desired performance- complexity tradeoffs are attained and a fixed- complexity version can be produced to facilitate hardware implementation. Simulation results demonstrate that the proposed algorithm shows abilities to achieve highly favorable performance- complexity tradeoffs.