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
01 Jan 2009

1 citations

Journal Article
TL;DR: In this article, the authors consider an Erdos-Renyi random graph in which each edge is present independently with probability = 1/2$1/2, except for a subset of the vertices that form a clique.
Abstract: Consider an Erdos---Renyi random graph in which each edge is present independently with probability $$1/2$$1/2, except for a subset $$\mathsf{C}_N$$CN of the vertices that form a clique (a complete...

1 citations

Proceedings ArticleDOI
Ronald Fagin1
26 Jun 2000
TL;DR: An approach to the P = NP question via the correspondence between logic and complexity via the possible use of Ehrenfeucht-Fraisse games is discussed.
Abstract: In this talk, I will discuss an approach to the P = NP question via the correspondence between logic and complexity. The focus will be on the possible use of Ehrenfeucht-Fraisse games.

1 citations

Proceedings Article
01 Nov 1990
TL;DR: In this paper, it was shown that a feedback shift register whose feedback function is of the form x 1 + h(x 2,..., xn) can generate long periodic sequences with high linear complexites only if its linear and quadratic terms have certain forms.
Abstract: In this paper, we study sequences generated by arbitrary feedback registers (not necessarily feedback shift registers) with arbitrary feedforward functions. We generalize the definition of linear complexity of a sequence to the notions of strong and weak linear complexity of feedback registers. A technique for finding upper bounds for the strong linear complexities of such registers is developed. This technique is applied to several classes of registers. We prove that a feedback shift register whose feedback function is of the form x 1 + h(x 2, ..., xn) can generate long periodic sequences with high linear complexites only if its linear and quadratic terms have certain forms.

1 citations

01 Jan 1994
TL;DR: The main contributions of this paper are the first parallel algorithms for two problems i and ii, which can be solved in O k time using a polynomial number of processors and an e cient algorithm for problem ii when k the algorithm runs in logarithmic time.
Abstract: An integer sequence d is called a degree sequence if there exists a simple graph G such that the degrees of its vertices are precisely the components of d in that case G is a realization of d Given d and an integer k we study two problems i compute a k edge connected realization of d ii compute a k vertex connected realization of d The main contributions of this paper are the rst parallel algorithms for these problems Speci cally we show that problem i can be solved in O k time using a polynomial number of processors For problem ii we present an e cient algorithm when k the algorithm runs in logarithmic time using a linear number of processors

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