- Copertina di Polynomial Time
- Titolo del libro:
-
Polynomial Time
Betascript Publishing (06.06.2010 )
eleggibile a buono
- ISBN-13:
978-613-0-33832-9
- ISBN-10:
- 6130338325
- EAN:
- 9786130338329
- Lingua del libro:
- Risvolto di copertina:
- 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".
- Casa editrice:
- Betascript Publishing
- Sito Web:
- https://www.betascript-publishing.com/
- A cura di:
- Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Numero di pagine:
- 140
- Pubblicato il:
- 06.06.2010
- Giacenza di magazzino:
- Disponibile
- categoria:
- Matematica
- Prezzo:
- 45,00 €
- Parole chiave:
- Computer Science, Analysis of Algorithms, Algorithm, Computation, Abstract Machine, Upper and Lower Bounds, Complexity Class, P Complexity
