Narrow your search

Library

AP (3)

KDG (3)

ULB (3)

EhB (2)

KU Leuven (2)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UCLL (2)

UGent (2)

More...

Resource type

book (6)

digital (3)


Language

English (8)

German (1)


Year
From To Submit

2016 (2)

2011 (2)

2008 (4)

1999 (1)

Listing 1 - 9 of 9
Sort by
Introduction to circuit complexity : a uniform approach
Author:
ISBN: 3540643109 3642083986 3662039273 Year: 1999 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study. It begins with efficient Boolean circuits for problems with high practical relevance, e.g., arithmetic operations, sorting, and transitive closure, then compares the computational model of Boolean circuits with other models such as Turing machines and parallel machines. Examination of the complexity of specific problems leads to the definition of complexity classes. The theory of circuit complexity classes is then thoroughly developed, including the theory of lower bounds and advanced topics such as connections to algebraic structures and to finite model theory.

Keywords

Computer science --- Algebra, Boolean. --- Computational complexity. --- Electronic digital computers --- Logic, Symbolic and mathematical. --- Circuits --- Design. --- Computers. --- Algorithms. --- Mathematical logic. --- Computer mathematics. --- Electronics. --- Microelectronics. --- Theory of Computation. --- Computation by Abstract Devices. --- Algorithm Analysis and Problem Complexity. --- Mathematical Logic and Formal Languages. --- Computational Mathematics and Numerical Analysis. --- Electronics and Microelectronics, Instrumentation. --- Microminiature electronic equipment --- Microminiaturization (Electronics) --- Electronics --- Microtechnology --- Semiconductors --- Miniature electronic equipment --- Electrical engineering --- Physical sciences --- Computer mathematics --- Electronic data processing --- Mathematics --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Algorism --- Algebra --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Foundations --- Automatic digital computers --- Computers, Electronic digital --- Digital computers, Electronic --- Computers --- Hybrid computers --- Sequential machine theory


Book
Complexity of Constraints : An Overview of Current Research Themes
Authors: --- ---
ISBN: 3540928006 3540927999 Year: 2008 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the computational complexity of certain algorithmic tasks related to constraint satisfaction. The complexity-theoretic results of these tasks may have a direct impact on, for instance, the design and processing of database query languages, or strategies in data-mining, or the design and implementation of planners. This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006. A number of speakers were solicited to write surveys presenting the state of the art in their area of expertise. These contributions were peer-reviewed by experts in the field and revised before they were collated to the 9 papers of this volume. In addition, the volume contains a reprint of a survey by Kolaitis and Vardi on the logical approach to constraint satisfaction that first appeared in 'Finite Model Theory and its Applications', published by Springer in 2007.

Keywords

Constraint programming (Computer science) --- Computational complexity --- Constraints (Artificial intelligence) --- Algebra, Boolean. --- Research --- Boolean algebra --- Boole's algebra --- Algebraic logic --- Set theory --- Constraint satisfaction (Artificial intelligence) --- Artificial intelligence --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computer programming --- Computer science. --- Computer software. --- Data structures (Computer scienc. --- Computational complexity. --- Artificial intelligence. --- Computer graphics. --- Programming Techniques. --- Algorithm Analysis and Problem Complexity. --- Data Structures. --- Discrete Mathematics in Computer Science. --- Artificial Intelligence. --- Computer Graphics. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Engineering graphics --- Image processing --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Software, Computer --- Computer systems --- Informatics --- Science --- Digital techniques --- Computer programming. --- Algorithms. --- Data structures (Computer science). --- Computer science—Mathematics. --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Algorism --- Algebra --- Arithmetic --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Foundations --- Programming --- Artificial intelligence—Data processing. --- Discrete mathematics. --- Data Science. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis


Book
Dependence logic : theory and applications
Authors: --- --- ---
ISBN: 3319318012 3319318039 Year: 2016 Publisher: Cham : Springer International Publishing : Imprint: Birkhäuser,

Loading...
Export citation

Choose an application

Bookmark

Abstract

In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning expressive power of several variants of dependence logic with different sets of logical connectives and generalized dependence atoms; connections between inclusion logic and the least-fixed point logic; an overview of dependencies in databases by addressing the relationships between implication problems for fragments of statistical conditional independencies, embedded multivalued dependencies, and propositional logic; various Markovian models used to characterize dependencies and causality among variables in multivariate systems; applications of dependence logic in social choice theory; and an introduction to the theory of secret sharing, pointing out connections to dependence and independence logic.


Book
Complexity of Constraints : An Overview of Current Research Themes
Authors: --- --- ---
ISBN: 9783540928003 Year: 2008 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the computational complexity of certain algorithmic tasks related to constraint satisfaction. The complexity-theoretic results of these tasks may have a direct impact on, for instance, the design and processing of database query languages, or strategies in data-mining, or the design and implementation of planners. This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006. A number of speakers were solicited to write surveys presenting the state of the art in their area of expertise. These contributions were peer-reviewed by experts in the field and revised before they were collated to the 9 papers of this volume. In addition, the volume contains a reprint of a survey by Kolaitis and Vardi on the logical approach to constraint satisfaction that first appeared in 'Finite Model Theory and its Applications', published by Springer in 2007.


Digital
Dependence Logic : Theory and Applications
Authors: --- --- ---
ISBN: 9783319318035 Year: 2016 Publisher: Cham Springer International Publishing, Imprint: Birkhäuser

Loading...
Export citation

Choose an application

Bookmark

Abstract

In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning expressive power of several variants of dependence logic with different sets of logical connectives and generalized dependence atoms; connections between inclusion logic and the least-fixed point logic; an overview of dependencies in databases by addressing the relationships between implication problems for fragments of statistical conditional independencies, embedded multivalued dependencies, and propositional logic; various Markovian models used to characterize dependencies and causality among variables in multivariate systems; applications of dependence logic in social choice theory; and an introduction to the theory of secret sharing, pointing out connections to dependence and independence logic.


Digital
Algorithms Unplugged
Authors: --- --- --- --- --- et al.
ISBN: 9783642153280 Year: 2011 Publisher: Berlin, Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Taschenbuch der Algorithmen
Authors: --- --- --- --- --- et al.
ISBN: 3540763945 Year: 2008 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Hinter vielen Programmen stecken clevere Verfahren, die man als Algorithmen bezeichnet. Algorithmen lösen nicht nur mathematische Aufgaben, die sich mit Zahlen beschäftigen, sondern auch andere, ganz alltägliche Problemstellungen, bei denen logischer Spürsinn, räumliche Orientierung oder geschicktes Verhandeln gefragt sind, beispielsweise: Wie lässt sich der kürzeste Weg zwischen zwei Orten ermitteln? Wie sollten Seeräuber eine Schatzkarte aufteilen, bzw. Bankangestellte den Geheimcode des Tresors? Wie können mehrere hungrige Partygäste einen Kuchen gerecht untereinander aufteilen? Dieses Buch vollführt einen Streifzug durch die faszinierende Welt der Algorithmen. Es verlangt keine Vorkenntnisse, so dass Schüler ab der Mittelstufe und Informatik-interessierte Laien neue und überraschende Einblicke gewinnen können. In 43 Artikeln von Informatikern, die an Universitäten im In- und Ausland lehren, werden wichtige und besonders elegante Algorithmen anschaulich und umgangssprachlich erklärt.


Book
Algorithms Unplugged
Authors: --- --- --- --- --- et al.
ISBN: 9783642153280 Year: 2011 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas - they facilitate new applications in science, medicine, production, logistics, traffic, communication and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs - for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity - the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.


Digital
Listing 1 - 9 of 9
Sort by