Polynomial Time: Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity - Couverture souple

 
9786130338329: Polynomial Time: Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity
Couverture souple
ISBN 10 : 6130338325 ISBN 13 : 9786130338329
Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, polynomial time refers to the running time of an algorithm, that is, the number of computation steps a computer or an abstract machine requires to evaluate the algorithm. An algorithm is said to be polynomial time if its running time is upper bounded by a polynomial in the size of the input for the algorithm. Problems for which a polynomial time algorithm exists belong to the complexity class PTIME, which is central in the field of computational complexity theory. Cobham''s thesis states that polynomial time is a synonym for tractable", "feasible", "efficient", or "fast". "

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Betascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6130338325
ISBN 13 
9786130338329
Reliure
Broché
Nombre de pages
140
Éditeur
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Coordonnées du fabricant
non disponible
Personne responsable
non disponible