Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*F13 --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2}

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computational complexity --- Complexité de calcul (Informatique) --- 681.3*F13 --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2}

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical analysis --- Computer science --- Computational complexity --- Complexité de calcul (Informatique) --- Computational Complexity --- 510.5 --- 681.3*F13 --- Complexity, Computational --- Electronic data processing --- Machine theory --- Algorithms. Computable functions --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 510.5 Algorithms. Computable functions

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for theoretical computer science. The thesis of this book, however, is that it provides an inadequate foundation for modern scientific computation where most of the algorithms are real number algorithms. The goal of this book is to develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing. Along the way, the authors consider such fundamental problems as: * Is the Mandelbrot set decidable? * For simple quadratic maps, is the Julia set a halting set? * What is the real complexity of Newton's method? * Is there an algorithm for deciding the knapsack problem in a ploynomial number of steps? * Is the Hilbert Nullstellensatz intractable? * Is the problem of locating a real zero of a degree four polynomial intractable? * Is linear programming tractable over the reals? The book is divided into three parts: The first part provides an extensive introduction and then proves the fundamental NP-completeness theorems of Cook-Karp and their extensions to more general number fields as the real and complex numbers. The later parts of the book develop a formal theory of computation which integrates major themes of the classical theory and which is more directly applicable to problems in mathematics, numerical analysis, and scientific computing.

Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Temps réel --- Computational complexity --- Computer algorithms --- Computer science --- Real-time data processing --- #TELE:SISTA --- 681.3*F13 --- Fast-response data processing --- High-speed data processing --- Electronic data processing --- Informatics --- Science --- Algorithms --- Complexity, Computational --- Machine theory --- Computational complexity. --- Computer algorithms. --- Computer science. --- Real-time data processing. --- Informatique --- Complexité de calcul (Informatique) --- Algorithmes --- Fractales --- Algorithmique --- Complexite

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- 681.3*F0 --- 681.3*F13 --- Computerwetenschap--?*F0 --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Computer network architectures. --- Computer science. --- Computer software. --- Logic design. --- Computer System Implementation. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Logics and Meanings of Programs. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Software, Computer --- Computer systems --- Informatics --- Science --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture --- Algèbre --- Algebra --- Algèbre. --- Langages de programmation --- Logique --- Algèbre