En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK
1

Introduction à la théorie de la complexité

Bookmarks Report an error
Multi angle
Authors : Lassaigne, Richard (Author of the conference)
CIRM (Publisher )

Loading the player...

Abstract : 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

MSC Codes :
68Q15 - Complexity classes (hierarchies, relations among complexity classes, etc.)
68Q17 - Computational difficulty of problems
68W20 - randomized algorithms
68W25 - Approximation algorithms
68Q19 - Descriptive complexity and finite models

    Information on the Video

    Film maker : Hennenfent, Guillaume
    Language : French
    Available date : 27/08/14
    Conference Date : 22/04/14
    Subseries : Research talks
    arXiv category : Computer Science ; Computational Complexity ; Data Structures and Algorithms
    Mathematical Area(s) : Computer Science
    Format : MP4 (.mp4) - HD
    Video Time : 01:09:55
    Targeted Audience : Researchers
    Download : https://videos.cirm-math.fr/2014-04-22_Lassaigne.mp4

Information on the Event

Event Title : Algorithm and programming / Algorithmique et programmation
Event Organizers : Dorra, Francis
Dates : 21/04/14 - 25/04/14
Event Year : 2014

Citation Data

DOI : 10.24350/CIRM.V.18596603
Cite this video as: Lassaigne, Richard (2014). Introduction à la théorie de la complexité. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.18596603
URI : http://dx.doi.org/10.24350/CIRM.V.18596603

Bibliography



Bookmarks Report an error