Listing 1 - 10 of 2427 | << page >> |
Sort by
|
Choose an application
Choose an application
Complex analysis --- Computer science --- toegepaste informatica --- complexe analyse (wiskunde)
Choose an application
Complex analysis --- Computer science --- complexe analyse (wiskunde) --- informatica
Choose an application
Complex analysis --- Computer science --- toegepaste informatica --- complexe analyse (wiskunde)
Choose an application
Complex analysis --- Computer. Automation --- complexe analyse (wiskunde) --- automatisering
Choose an application
This textbook discusses the most fundamental and puzzling questions about the foundations of computing. In 23 lecture-sized chapters it provides an exciting tour through the most important results in the field of computability and time complexity, including the Halting Problem, Rice's Theorem, Kleene's Recursion Theorem, the Church-Turing Thesis, Hierarchy Theorems, and Cook-Levin's Theorem. Each chapter contains classroom-tested material, including examples and exercises. Links between adjacent chapters provide a coherent narrative. Fundamental results are explained lucidly by means of programs written in a simple, high-level imperative programming language, which only requires basic mathematical knowledge. Throughout the book, the impact of the presented results on the entire field of computer science is emphasised. Examples range from program analysis to networking, from database programming to popular games and puzzles. Numerous biographical footnotes about the famous scientists who developed the subject are also included. "Limits of Computation" offers a thorough, yet accessible, introduction to computability and complexity for the computer science student of the 21st century.
Complex analysis --- Computer science --- complexe analyse (wiskunde) --- computers --- algoritmen --- computerkunde
Choose an application
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.
Complex analysis --- Computer science --- complexe analyse (wiskunde) --- algoritmen
Choose an application
Complex analysis --- Applied physical engineering --- Engineering sciences. Technology --- procesautomatisering --- complexe analyse (wiskunde) --- systeemtheorie --- systeembeheer --- regeltechniek
Choose an application
Complex analysis --- Computer science --- Information systems --- ICT (informatie- en communicatietechnieken) --- cryptologie --- complexe analyse (wiskunde) --- informatiesystemen --- programmatielogica
Choose an application
Complex analysis --- Computer science --- toegepaste informatica --- DES (data encryption standard) --- cryptologie --- complexe analyse (wiskunde) --- informatica
Listing 1 - 10 of 2427 | << page >> |
Sort by
|