Complexity Theory: Pros and Cons - Syzdykov, Mirzakhmet
39,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
payback
20 °P sammeln
  • Broschiertes Buch

In this book we present theoretical, practical and experimental approaches towards the proofs of equivalence or not equivalence of complexity classes known as a relational theory.Both proofs and disproofs are made on the account of "P versus NP" theorem which was first invented by Stephen Cook and later found profound application for analyzing the algorithm performance, thus, giving the definition of optimization theory and theory of description of this performance in terms which are well-suited and are known as little o- or big O-notation - the median value also exists.

Andere Kunden interessierten sich auch für
Produktbeschreibung
In this book we present theoretical, practical and experimental approaches towards the proofs of equivalence or not equivalence of complexity classes known as a relational theory.Both proofs and disproofs are made on the account of "P versus NP" theorem which was first invented by Stephen Cook and later found profound application for analyzing the algorithm performance, thus, giving the definition of optimization theory and theory of description of this performance in terms which are well-suited and are known as little o- or big O-notation - the median value also exists.
Autorenporträt
Mirzakhmet Syzdykov. Nato l'11/09/84. Studente presso l'Università Satbayev, Almaty, Kazakistan, 2001-2006.