NP-Complete
CHF 43.25
Auf Lager
SKU
S9MQIC0VB94
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Do., 06.11.2025 und Fr., 07.11.2025
Details
High Quality Content by WIKIPEDIA articles! In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC), is a class of problems having two properties: Any given solution to the problem can be verified quickly (in polynomial time); the set of problems with this property is called NP (nondeterministic polynomial time). If the problem can be solved quickly (in polynomial time), then so can every problem in NP. Although any given solution to such a problem can be verified quickly, there is no known efficient way to locate a solution in the first place; indeed, the most notable characteristic of NP-complete problems is that no fast solution to them is known. That is, the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows. As a result, the time required to solve even moderately large versions of many of these problems easily reaches into the billions or trillions of years, using any amount of computing power available today. As a consequence, determining whether or not it is possible to solve these problems quickly is one of the principal unsolved problems in computer science today.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130333287
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T5mm
- Jahr 2010
- EAN 9786130333287
- Format Kartonierter Einband
- ISBN 978-613-0-33328-7
- Titel NP-Complete
- Untertitel Computational Complexity Theory, Complexity Class, Polynomial Time, Unsolved Problems in Computer Science, Approximation Algorithm, Subset
- Gewicht 142g
- Herausgeber Betascript Publishers
- Anzahl Seiten 84
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
