Algorithm and programming / Algorithmique et programmation

Collection Algorithm and programming / Algorithmique et programmation

Organizer(s) Albert, Luc ; Dorra, Francis ; Petit, Antoine
Date(s) 02/05/2016 - 06/05/2016
linked URL http://conferences.cirm-math.fr/1446.html
00:00:00 / 00:00:00
1 26

Introduction à la théorie de la complexité

By Richard Lassaigne

Approximation methods and probabilistic algorithms are two important ways to obtain efficient algorithms giving approximate solutions to hard problems. We give some examples from optimization, counting and verification problems. Property testing is also a very efficient method to approximate verification problems. complexity - difficult problem - approximation - probabilistic approximation schemes - optimization - counting verification - property testing

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.18596603
  • Cite this video Lassaigne, Richard (22/04/2014). Introduction à la théorie de la complexité. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.18596603
  • URL https://dx.doi.org/10.24350/CIRM.V.18596603

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback