Hasil Pencarian  ::  Simpan CSV :: Kembali

"Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation."

"An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes."

"Classical methods in analytic theory such as Mertens’ theorem and Chebyshev’s inequalities and the celebrated Prime number theorem give estimates for the distribution of prime numbers. Later on, multiplicative structure of integers leads to multiplicative arithmetical functions for which there are many important examples in number theory. Their theory involves the Dirichlet convolution product which arises with the inclusion of several summation techniques and a survey of classical results such as Hall and Tenenbaum’s theorem and the Möbius Inversion Formula. Another topic is the counting integer points close to smooth curves and its relation to the distribution of squarefree numbers, which is rarely covered in existing texts. Final chapters focus on exponential sums and algebraic number fields. A number of exercises at varying levels are also included."