scispace - formally typeset
Search or ask a question
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
More filters
Book ChapterDOI
04 Dec 1995
TL;DR: A characterization of Levin's notion of functions, that are polynomial on average, gives a very smooth translation from worst case complexity to average case complexity of the notions for time and space complexity.
Abstract: In 1990 Schapire gave an equivalent characterization of Levin's notion of functions, that are polynomial on average. This characterization gives a very smooth translation from worst case complexity to average case complexity of the notions for time and space complexity. We prove tight space and time hierarchy theorems and discuss the structure of deterministic and nondeterministic average case complexity classes.

1 citations

Journal ArticleDOI
TL;DR: This study proposes a new adaptive full search algorithm using the temporal correlation method and iterative layer process, which is useful to decrease the computational complexity and achieves an optimal level of accuracy.

1 citations

Journal Article
TL;DR: 2mpn-periodic binary sequences, made use of the tools such as polynomial factorization, provides the bounds of the minimum value k such that the k-error linear complexity is strictly less than the linear complexity.
Abstract: The stability of the linear complexity was an important index to scale a sequence’s randomicity. For 2mpn-periodic binary sequences, where p was a odd prime and 2 was a primitive root module p2, made use of the tools such as polynomial factorization, provides the bounds of the minimum value k such that the k-error linear complexity is strictly less than the linear complexity.

1 citations

01 Jan 2013
TL;DR: This paper defines and studies the linear complexity of binary lattices, and analyzes the connection between linear complexity and correlation measures, and utilizes the inequalities obtained in this way for estimating thelinear complexity of an important special binary lattice.
Abstract: The linear complexity is an important and frequently used measure of unpredictability and pseudorandomness of binary sequences. In this paper our goal is to extend this notion to two dimensions. We will define and study the linear complexity of binary lattices. The linear complexity of a truly random binary lattice will be estimated. Finally, we will analyze the connection between the linear complexity and the correlation measures, and we will utilize the inequalities obtained in this way for estimating the linear complexity of an important special binary lattice. Finally, we will study the connection between the linear complexity of binary lattices and of the associated binary sequences.

1 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
89% related
Approximation algorithm
23.9K papers, 654.3K citations
87% related
Data structure
28.1K papers, 608.6K citations
83% related
Upper and lower bounds
56.9K papers, 1.1M citations
83% related
Computational complexity theory
30.8K papers, 711.2K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
20216
202010
20199
201810
201732