THEORY OF SEMI FEASEABLE ALGORITHMS
Ouvrage 9783540422006 : THEORY OF SEMI FEASEABLE ALGORITHMS
This book presents a consolidated survey of the vibrant field of
research known as the theory of semi-feasible algorithms. This research
stream perfectly showcases the richness of, and contrasts between, the
central notions of complexity: running time, nonuniform complexity,
lowness, and NP-hardness. Research into semi-feasible computation has
already developed a rich set of tools, yet is young enough to have an
abundance of fresh, open issues.
Being essentially self-contained, the book requires neither great
mathematical maturity nor an extensive background in computational
complexity theory or in computer science in general. Newcomers are
introduced to the field systematically and guided to the frontiers of
current research. Researchers already active in the field will
appreciate the book as a valuable source of reference.
Keywords: Algorithms, Circuits, Complexity, Discrete Mathematics,
semi-feasible algorithms
Series: Monographs in Theoretical Computer Science. An EATCS Series.
Auteur : HEMASPAANDRA
Editeur : SPRINGER VERLAG
Nombre de pages : 160
Date de publication : 12 2002
Toute la sélection
Toutes les sélections
Toute la sélection
Site réalisé en partenariat avec Courbis
(Courbis - alternate link), acteur de l'Internet depuis 1988...
Le Monde En Tique