In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Dennis Amelunxen, Martin Lotz
- J. Complexity
- 2017

We introduce the concept of weak average-case analysis as an attempt to achieve theoretical complexity results that are closer to… (More)

Is this relevant?

2016

2016

- Michael J. Bremner, Ashley Montanaro, Dan J. Shepherd
- Physical review letters
- 2016

We use the class of commuting quantum computations known as IQP (instantaneous quantum polynomial time) to strengthen the… (More)

Is this relevant?

2013

2013

- Zoltán Ádám Mann, Aniko Szajko
- J. Comput. Syst. Sci.
- 2013

We investigate asymptotically the expected number of steps taken by backtrack search for k-coloring random graphs Gn,p(n) or… (More)

Is this relevant?

2010

2010

- Benjamin Rossman
- 2010

The computational problem of testing whether a graph contains a complete subgraph of size k is among the most fundamental… (More)

Is this relevant?

Review

2007

Review

2007

- Oded Goldreich, Salil P. Vadhan
- computational complexity
- 2007

Average-case complexity, which examines the tractability of computational problems on ‘random instances,’ is a major topic in… (More)

Is this relevant?

2005

2005

We consider the expected number of Voronoi vertices (or number of Delaunay cells for the dual structure) for a set of n i.i.d… (More)

Is this relevant?

2004

2004

- Luc Devroye, Christophe Lemaire, Jean-Michel Moreau
- Comput. Geom.
- 2004

Abstract. We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze… (More)

Is this relevant?

2003

2003

- Ulrich Meyer
- J. Algorithms
- 2003

We study the average-case running-time of single-source shortest-path (SSSP) algorithms assuming arbitrary directed graphs with n… (More)

Is this relevant?

2002

2002

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and… (More)

Is this relevant?

2001

2001

- Volker Priebe
- 2001

We study both upper and lower bounds on the average-case complexity of shortestpaths algorithms. It is proved that the all-pairs… (More)

Is this relevant?