Ising machines are hardware solvers that aim to find the absolute or approximate ground
states of the Ising model. The Ising model is of fundamental computational interest because …

In the last few years, the formulation of real-world optimization problems and their efficient
solution via metaheuristic algorithms has been a catalyst for a myriad of research studies. In …

Automata, Computability, and Complexity 1/Complexity theory 2/Computability theory
2/Automata theory 3/Mathematical Notions and Terminology 3/Sets 3/Sequences and tuples …

This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

We present randomized approximation algorithms for the maximum cut (MAX CUT) and
maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected …

Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

The next few years will be exciting as prototype universal quantum processors emerge,
enabling the implementation of a wider variety of algorithms. Of particular interest are …

The cross-entropy (CE) method is a new generic approach to combinatorial and multi-
extremal optimization and rare event simulation. The purpose of this tutorial is to give a …

Given a collection ℱ of subsets of S={1,…, n}, set cover is the problem of selecting as few as
possible subsets from ℱ such that their union covers S,, and max k-cover is the problem of …

Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …