P.T. Kahl – författare

Visar alla böcker från författaren P.T. Kahl. Handla med fri frakt och snabb leverans.

3 produkter

1. 

   Computational Complexity and Feasibility of Data Processing and Interval Computations

   Av V. Kreinovich, A.V. Lakeyev m. fl.

   Inbunden, 1997

   2179 kr

   Lägg i varukorg

   The input data for data processing algorithms come from measurements and are therefore not precise. It is therefore necessary to estimate the accuracy of the results of data processing. Even for the simplest data processing algorithms, this problem is, however, intractable. This book describes for …

2. 

   Computational Complexity and Feasibility of Data Processing and Interval Computations

   Av V. Kreinovich, A.V. Lakeyev m. fl.

   Häftad, 2010

   2179 kr

   Lägg i varukorg

   Targeted audience • Specialists in numerical computations, especially in numerical optimiza­ tion, who are interested in designing algorithms with automatie result ver­ ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. • Mathematicians …

3. 

   Computational Complexity and Feasibility of Data Processing and Interval Computations

   Av P.T. Kahl, J. Rohn m. fl.

   E-bok, 2013

   2925 kr

   Lägg i varukorg

   Targeted audience • Specialists in numerical computations, especially in numerical optimiza­ tion, who are interested in designing algorithms with automatie result ver­ ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. • Mathematicians …