Advertisement

Probabilistic Algorithms

  • José Luis Balcázar
  • Josep Díaz
  • Joaquim Gabarró
Part of the EATCS Monographs on Theoretical Computer Science Series book series (EATCS, volume 11)

Abstract

In recent times, probabilistic methods have become increasingly used in the design and analysis of algorithms. On the one hand, they have been applied to the analysis of the average case complexity of deterministic exact or approximate algorithms. On the other hand, (pseudo-)random number generators can be incorporated into an algorithm, in such a way that the algorithm will answer correctly with a reasonably high probability. These are called probabilistic, or randomized, algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • José Luis Balcázar
    • 1
  • Josep Díaz
    • 1
  • Joaquim Gabarró
    • 1
  1. 1.Facultat d’InformàticaUniversität Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations