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
De Dominique Barbolosi
De Dominique Barbolosi
De Luc Bougé
De Gilles Dowek
De François Boisson
De Gérard Berry
De Simon Lacoste-Julien
De Olivier Bournez
De Judicaël Courant
De Frédéric Vivien
De Frédéric Vivien
De Gilles Dowek
De Albert Schwarz
De Albert Schwarz
De Clément Delcamp
De Clément Delcamp
De Giuseppe Savaré
De Stephen Coombes , Peter Liddle
De Victor Kleptsyn
De François-Xavier Vialard
