Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Average-case complexity

Known as: Average case complexity, Average case computational complexity, Expected time 
In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
The basic problem in the PAC model of computational learning theory is to determine which hypothesis classes are effficiently… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
argumentation may be further advanced. We stress that our aim is to focus on general areas rather than particular open questions… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We show that solving modular linear equation on the average is at least as hard as approximating several lattice problems in the… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We investigate relations between average case complexity and the complexity of approximation. Our preliminary findings indicate… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We give a deterministic algorithm for triangulating a simple polygon in linear time. The basic strategy is to build a coarse… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We study the average case complexity of multivariate integration for the class of continuous functions of d variables equipped… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A. Levin. Previous works… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
  • Paul Feldman
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
  • Corpus ID: 16283693
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
When using MIMD (multiple instruction, multiple data) parallel computers, one is often confronted with solving a task composed of… Expand
  • figure 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?