Accueil
Plan du site
Bloc notes
Jeux
Graphes
Combinatoire
Arithmétique
Algèbre
Analyse
Probabilités
Automates
Programmation
Divers
Liens
Home

Worst EU Lobbying
Awards 2007
Votez maintenant

UniversitySurf.net
Votre portail e-Learning

CultureMATH
ENSup. et Minist. EN

On-Line Encyclopedia
of Integer Sequences

Séminaire MaMuX
Mathématiques, musique et relations avec d'autres disciplines

L'INVERSEUR
de Plouffe

ZOHO^® permet de lire les documents doc ppt pdf...
Cliquez ici

Complexité - Complexity

PAGES WEB

Stas Busygin's NP-Completeness Page

amirror

<http://www.busygin.dp.ua/npc.html>

Complexity classes P and NP

From Wikipedia, the free encyclopedia.

<http://www.wikipedia.com/wiki/Complexity+classes+P+and+NP>

A compendium of NP optimization problems

This is a continuously updated catalog of approximability results for NP optimization problems. The compendium is also a part of the book Complexity and Approximation.

<http://www.nada.kth.se/~viggo/wwwcompendium/wwwcompendium.html>

My Computational Complexity Web Log

Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow.

<http://fortnow.com/lance/complog/>

Kolmogorov Complexity and Solomonoff Induction

Marcus Hutter

<http://www.hutter1.de/kolmo.htm>

On-line Compression Modelling

Vladimir Vovk

<http://www.vovk.net/kp/index.html>

Complexity Theory - Material

Oded Goldreich Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel.

<http://www.wisdom.weizmann.ac.il/~oded/cc.html>

PROBLÈMES - PROBLEMS

A compendium of NP optimization problems

Viggo Kann

This is a continuously updated catalog of approximability results for NP optimization problems. The compendium is also a part of the book Complexity and Approximation. The compendium has not been updated for a while, so there might exist recent results that are not mentioned in the compendium. If you happen to notice such a missing result, please report it to us using the web forms.

<http://www.nada.kth.se/~viggo/problemlist/compendium.html>

LIVRES - BOOKS

The Complexity Theory Companion

Lane A. Hemaspaandra and Mitsunori Ogihara,

The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic.

<http://www.cs.rochester.edu/u/lane/=companion/>

DOCUMENTS - PAPERS

Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences

We also consider a new type of complexity-statistical complexity closely related to mathematical statistics.

<http://www3.oup.co.uk/computer_journal/hdb/Volume_42/Issue_04/420294.sgm.abs.html>

New Applications of the Incompressibility Method

Tao Jiang, Ming Li, and Paul Vitányi

<http://www3.oup.co.uk/computer_journal/hdb/Volume_42/Issue_04/420287.sgm.abs.html>

COURS - COURSES

Théorie de la complexité

Documents de cours et d'exercices Pascal Laurent Ecole Centrale Paris

<http://www.cti.ecp.fr/~laurent/Modef/Documents/M03G_3c.pdf>

Complexity of Algorithms

Laszlo Lovasz

<http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html>

TUTORIELS - TUTORIALS

NP-complete problem,

<http://www.cs.auc.dk/~luca/FS2/NP-completeness.html>

A compendium of NP optimization problems

<http://www.nada.kth.se/~viggo/wwwcompendium/wwwcompendium.html>

LIENS - LINKS

Shannon

<liens_shannon.html>

Coding and Information theory

<liens_coding.html>

Mathématiques - Page de liens

<liens_math.html>

Minimum Encoding Length Inference

David L. Dowe, Monash University

<http://www.csse.monash.edu.au/~dld/MELI.html>

Actualités

Advertising : If you see a reference in one of the files that is not linked, and you know of a link address to the appropriate document, please send me mail, and I will include the link in the document. Thanks very much in advance.
Avertissement : Le classement par catégories est approximatif. Certains liens se retrouvent dans des rubriques différentes et sur plusieurs pages. Les commentaires sont généralement des courts extraits des pages référencées. Il est possible que certains liens nécessitent une mise à jour.
Tous commentaires ou remarques sont les bienvenus, vous pouvez les adresser à :

Les mises à jour demandées sont réalisées dès que possible et, sauf si c'est nécessaire, aucun message de réponse n'est expédié. Merci de m'écrire.

Copyright © 1999-2006 Jean-Paul Davalan - Reproduction interdite.