Skip to main content
Book Chapter

Probabilistic Analysis of Algorithms

  • Frieze A
  • Reed B
DOI: 10.1007/978-3-662-12788-9_2
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Rather than analyzing the worst case performance of algorithms, one can investigate their performance on typical instances of a given size. This is the approach we investigate in this paper. Of course, the first question we must answer is: what do we mean by a typical instance of a given size?

Cite

CITATION STYLE

APA

Frieze, A. M., & Reed, B. (1998). Probabilistic Analysis of Algorithms (pp. 36–92). https://doi.org/10.1007/978-3-662-12788-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free