topmenu
Wyniki wyszukiwania:
wyszukanych pozycji: 6
 |
Completeness and Reduction in Algebraic Complexity Theory
ISBN: 9783642086045 / Angielski / Miękka / 2010 / 168 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet. By contrast, in algebraic models of computation, the basic computational step is an arithmetic operation (or comparison) of elements of a fixed field, for in stance of real numbers. Hereby one assumes exact arithmetic....
One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing...
|
cena:
402,53 |
 |
Condition: The Geometry of Numerical Algorithms
ISBN: 9783642440120 / Angielski / Miękka / 2015 / 554 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) This book deals with condition as a main aspect in the understanding of the performance regarding both stability and complexity of numerical algorithms. It offers partial solutions for Smale's 17th problem.
This book deals with condition as a main aspect in the understanding of the performance regarding both stability and complexity of numerical algorithm...
|
cena:
563,56 |
 |
Completeness and Reduction in Algebraic Complexity Theory
ISBN: 9783540667520 / Angielski / Twarda / 2000 / 168 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet. By contrast, in algebraic models of computation, the basic computational step is an arithmetic operation (or comparison) of elements of a fixed field, for in stance of real numbers. Hereby one assumes exact arithmetic....
One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing...
|
cena:
402,53 |
 |
Condition: The Geometry of Numerical Algorithms
ISBN: 9783642388958 / Angielski / Twarda / 2013 / 554 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) This book gathers threads that have evolved across different mathematical disciplines into seamless narrative. It deals with condition as a main aspect in the understanding of the performance ---regarding both stability and complexity--- of numerical algorithms. While the role of condition was shaped in the last half-century, so far there has not been a monograph treating this subject in a uniform and systematic way. The book puts special emphasis on the probabilistic analysis of numerical algorithms via the analysis of the corresponding condition. The exposition's level increases along the...
This book gathers threads that have evolved across different mathematical disciplines into seamless narrative. It deals with condition as a main aspec...
|
cena:
563,56 |
![Algebraic Complexity Theory Peter Burgisser Peter B]rgisser Michael Clausen 9783540605829](/9783540605829_algebraic_complexity_theory.jpg "Algebraic Complexity Theory") |
Algebraic Complexity Theory
ISBN: 9783540605829 / Angielski / Twarda / 1996 / 618 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a...
The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuiti...
|
cena:
563,56 |
 |
Algebraic Complexity Theory
ISBN: 9783642082283 / Angielski / Miękka / 2010 / 618 str. Termin realizacji zamówienia: ok. 22 dni roboczych (Bez gwarancji dostawy przed świętami) The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a...
The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuiti...
|
cena:
563,56 |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
