Complexité algorithmique - Algorithmic complexity (Sylvain Perifel)

 
0.0 (0)
Complexité algorithmique - Algorithmic complexity (Sylvain Perifel)

The foundational ideas of algorithmic complexity theory are first covered in this free programming book before moving on to a number of more sophisticated subjects.

 

It is the only French-language book that covers such a wide range of topics in this crucial field of theoretical computer science. No prerequisites are assumed, except than a fundamental understanding of mathematics. Instead, useful mathematical concepts are remembered.

Ce livre présente d'abord les notions de base en théorie de la complexité algorithmique avant de traiter de nombreux sujets avancés. Il s'agit du seul ouvrage en français couvrant un si large spectre dans ce domaine central en informatique théorique. Les notions mathématiques utiles sont rappelées et aucun prérequis, outre une culture mathématique de base, n'est supposé.

 

Ebook Details

About the Authors
Sylvain Perifel “Maître de Conférences” (senior lecturer) in computer science at the University of Paris (ex-Paris Diderot – Paris 7) and IRIF, member of the team's Algorithms and complexity and Automata and applications.
Publisher
License(s)
CC BY-NC-SA 3.0 FR
Language
French / français

Similar Programming & Computer Books

Éléments d'algorithmique - Algorithmic elements (D. Beauquier, et al)
This free programming book differs from other treatises on algorithms in two ways: first, we give special attention to the new tree structures that have emerged recently (bicolor trees,...
Algorithmique du texte - Text Algorithms (Maxime Crochemore, et al)
This free programming book offers a broad overview of text-processing algorithms. As such, it is an algorithmic book, but one whose goal is to utilize computers to manipulate language....
Computer Arithmetic of Geometrical Figures: Algorithms and Hardware Design (S. I. Khmelnik)
This free programming book describes many iterations of processors made for affine transformations of planar and spatial many-dimensional figures. This processor is designed to perform affine transformations on geometrical...
Parallel Complexity Theory (Sanjeev Arora, et al.)
The focus of this free programming book is the research of Parallel Computing and Programming, which serves as an abstract indicator of the complexity of parallel computing problems. ...
Computational Complexity: A Conceptual Perspective (Oded Goldreich)
The study of the innate complexity of computer jobs is introduced conceptually in this free programming book. It is meant to be used as a textbook or for independent...
Computational Complexity (Wikibooks)
All computer science grads should read this free programming book since it offers information that is fundamental to their understanding of computation theory. ...
Learning Processing: A Beginner's Guide to Programming Images, Animation, and Interaction (Daniel Shiffman)
This free programming book shows you how to use Processing to build the fundamental programming building blocks required to develop cutting-edge graphics applications, such as interactive art, live video...
The Complexity of Boolean Functions (Ingo Wegener)
One of the most fascinating and crucial areas of theoretical computer science presently includes research on the difficulty of Boolean functions in non-uniform processing models. It directly relates to...
Applied Combinatorics on Words (M. Lothaire)
This volume's goal is to provide a comprehensive analysis of some of the main areas in which combinatorics is applied. Core algorithms for text processing, natural language processing, audio...
A = B (Marko Petkovsek, et al)
Mathematicians and computer scientists who deal on combinatorics and finite mathematics will find this book interesting. It offers a ground-breaking approach to examining intricate summaries. ...

User reviews

There are no user reviews for this listing.
Ratings
Rate this Book
Comments