Bovet, Daniel Pierre <br/><br/>
Introduction to the theory of complexity 

 - Nueva York :  ,  c1994 
 - xi, 282 p. : il. ;  24 cm. 
 - International series in computer science .
<br/><br/> Incluye bibliografía. -- 
<br/><br/>Mathematical preliminaries -- Elements of computability theory -- Complexity classes -- The class P -- The class NP -- The complexity of optimization problems -- Beyond NP -- Space-complexity classes -- Probabilistic algorithms and complexity classes -- Interactive proof systems -- Models of parallel computers -- Parallel algorithms. 
<br/><br/><label>ISBN: </label>0139153802 
<br/><br/><label>Standard No.: </label>DIF001639 
<br/><br/><label>Subjects--Topical Terms: </label><br/>TEORÍA DE LA COMPUTABILIDAD<br/>COMPLEJIDAD COMPUTACIONAL<br/>ALGORITMOS PARALELOS