Polynomial Time: Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity - Tapa blanda
Sinopsis
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". "
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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". "
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Polynomial Time: Computer Science, Analysis of Algorithms,...
Imagen del vendedor
Polynomial Time
Publicado por
VDM Verlag Dr. Müller E.K. Jan 2010, 2010
ISBN 10: 6130338325
ISBN 13: 9786130338329
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! 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'. Englisch. Nº de ref. del artículo: 9786130338329
Comprar nuevo
EUR 45,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Polynomial Time : Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity
Publicado por
VDM Verlag Dr. Müller E.K., 2010
ISBN 10: 6130338325
ISBN 13: 9786130338329
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! 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'. Nº de ref. del artículo: 9786130338329
Comprar nuevo
EUR 46,20
Envío por EUR 61,13
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles