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
Journal Article
TL;DR: This work survey research that studies the connection between the computational complexity of optimization problems, and the duality gap between the primal and dual optimization problems on the other, to be the first survey that connects the two very important areas.
Abstract: We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the first survey that connects the two very important areas. We further look at a similar phenomenon in finite model theory relating to complexity and optimization.

11 citations

Journal ArticleDOI
TL;DR: This paper investigates computational complexity of functions Γ: C →{0, 1} ∗ and ∑: C→ C and the related concepts of dependence and input-lookahead and proves that Compact sets are proved to be natural domains of resource bounded functions on C.

11 citations

Proceedings ArticleDOI
14 Jun 1988
TL;DR: The nonuniformity of communication protocols is used to show that the Boolean communication hierarchy does not collapse, and some proper inclusions are shown.
Abstract: The complexity of communication between two processors is studied in terms of complexity classes. Previously published results showing some analogies between Turing machine classes and the corresponding communication complexity classes are enlarged, and some proper inclusions are shown. The nonuniformity of communication protocols is used to show that the Boolean communication hierarchy does not collapse. For completeness an overview on communication complexity classes is added with proofs of some properties already observed by other authors. >

11 citations

Journal ArticleDOI
01 Dec 2012
TL;DR: The notion of analytic complexity introduced by V.K. Beloshapka was introduced in this article, which allows one to check whether a bivariate analytic function belongs to the second class of complexity.
Abstract: The paper deals with the notion of analytic complexity introduced by V.K. Beloshapka. We give an algorithm which allows one to check whether a bivariate analytic function belongs to the second class of analytic complexity. We also provide estimates for the analytic complexity of classical discriminants and introduce the notion of analytic complexity of a knot.

11 citations

Proceedings ArticleDOI
01 Sep 2015
TL;DR: A simple information theoretic proof that the public-coin randomized communication complexity of the greater-than function is Ω(logn) for bit-strings of length n is given.
Abstract: We give a simple information theoretic proof that the public-coin randomized communication complexity of the greater-than function is Ω(logn) for bit-strings of length n.

11 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