Peter Bürgisser – författare
Visar alla böcker från författaren Peter Bürgisser. Handla med fri frakt och snabb leverans.
9 produkter
Algebraic Complexity Theory
Av Peter Bürgisser, Michael Clausen m. fl.
Inbunden, 1996
1534 kr
Lägg i varukorg
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 …
Completeness and Reduction in Algebraic Complexity Theory
Inbunden, 2000
1098 kr
Lägg i varukorg
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 …
Algebraic Complexity Theory
Av Peter Bürgisser, Michael Clausen m. fl.
Häftad, 2010
1534 kr
Lägg i varukorg
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 …
Completeness and Reduction in Algebraic Complexity Theory
Häftad, 2010
1098 kr
Lägg i varukorg
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 …
Condition
The Geometry of Numerical Algorithms
Av Peter Bürgisser, Felipe Cucker
Inbunden, 2013
1534 kr
Lägg i varukorg
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 …
Condition
The Geometry of Numerical Algorithms
Av Felipe Cucker, Peter Burgisser
E-bok, 2013
1948 kr
Lägg i varukorg
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 …
Condition
The Geometry of Numerical Algorithms
Av Peter Bürgisser, Felipe Cucker
Häftad, 2015
1534 kr
Lägg i varukorg
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 …
Algebraic Complexity Theory
Av Mohammad A. Shokrollahi, Michael Clausen m. fl.
E-bok, 2013
1948 kr
Lägg i varukorg
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 …
Completeness and Reduction in Algebraic Complexity Theory
E-bok, 2013
1427 kr
Lägg i varukorg
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 …
