Polynomial Time: Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity - Brossura
Sinossi
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". "
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Polynomial Time: Computer Science, Analysis of Algorithms,...
Immagini fornite dal venditore
Polynomial Time
Editore:
VDM Verlag Dr. Müller E.K. Jan 2010, 2010
ISBN 10: 6130338325
ISBN 13: 9786130338329
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9786130338329
Compra nuovo
EUR 45,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Polynomial Time : Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity
Editore:
VDM Verlag Dr. Müller E.K., 2010
ISBN 10: 6130338325
ISBN 13: 9786130338329
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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'. Codice articolo 9786130338329
Compra nuovo
EUR 46,20
Spedizione EUR 61,13
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili