Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …

Quantum computers are designed to outperform standard computers by running quantum
algorithms. Areas in which quantum algorithms can be applied include cryptography, search …

Combinatorial optimization is a well-established area in operations research and computer
science. Until recently, its methods have focused on solving problem instances in isolation …

“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

Perhaps surprisingly, it is possible to predict how long an algorithm will take to run on a
previously unseen input, using machine learning techniques to build a model of the …

One of the most important industrial applications of SAT is currently Bounded Model
Checking (BMC). This technique is typically used for formal hardware verification in the …

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

The task of algorithm selection involves choosing an algorithm from a set of algorithms on a
per-instance basis in order to exploit the varying performance of algorithms over a set of …

Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

Computationally challenging problems arise in the context of many applications, and the
ability to solve these as efficiently as possible is of great practical, and often also economic …