| Physical description |
xv, 396 pages ; 25 cm |
| Bibliography |
Includes bibliographical references (page -) and index. |
| Contents |
Pt. 1. Automata and Languages. 1. Regular Languages. 2. Context-Free Languages -- Pt. 2. Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced topics in complexity theory. |
| Summary |
Designed for researchers in advanced numerical methods or parallel computing, this definitive reference focuses on solving large and sparse linear systems of equations using computers. readers are provided with appropriate conceptual background information and hands-on applications throughout the book. |
| Subject |
Machine theory.
|
|
Computational complexity.
|
| ISBN |
053494728X |
|
