Narrow your search

Library

AP (2427)

KDG (2427)

VUB (274)

UAntwerpen (9)

UHasselt (4)

KU Leuven (3)


Resource type

digital (2427)

book (275)


Language

English (2423)

French (2)

Italian (2)


Year
From To Submit

2019 (11)

2018 (67)

2017 (48)

2016 (32)

2015 (247)

More...
Listing 1 - 10 of 2427 << page
of 243
>>
Sort by

Multi
Matters Computational : Ideas, Algorithms, Source Code
Author:
ISBN: 9783642147647 Year: 2011 Publisher: Berlin, Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Super-Recursive Algorithms
Author:
ISBN: 9780387268064 Year: 2005 Publisher: New York, NY Springer Science+Business Media Inc

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
New Software Engineering Paradigm Based on Complexity Science : An Introduction to NSE
Author:
ISBN: 9781441973269 Year: 2011 Publisher: New York, NY Springer New York

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Computability and Complexity Theory
Authors: ---
ISBN: 9781461406822 Year: 2011 Publisher: Boston, MA Springer US

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Design and Analysis of Approximation Algorithms
Authors: --- ---
ISBN: 9781461417019 Year: 2012 Publisher: New York, NY Springer New York

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Limits of Computation : From a Programming Perspective
Author:
ISBN: 9783319278896 Year: 2016 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.


Digital
Parameterized Algorithms
Authors: --- --- --- --- --- et al.
ISBN: 9783319212753 9783319212746 9783319212760 9783319357027 Year: 2015 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.


Digital
Randomized Algorithms for Analysis and Control of Uncertain Systems
Authors: --- ---
ISBN: 9781846280528 Year: 2005 Publisher: London Springer-Verlag London Limited

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Evolutionary Multiobjective Optimization : Theoretical Advances and Applications
Authors: --- ---
ISBN: 9781846281372 Year: 2005 Publisher: London Springer-Verlag London Limited

Loading...
Export citation

Choose an application

Bookmark

Abstract


Multi
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity
Author:
ISBN: 9783540285205 Year: 2005 Publisher: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

Listing 1 - 10 of 2427 << page
of 243
>>
Sort by