This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …

A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …

Our world, of course, changed in many other ways as well since the publication of the first
edition. The global pandemic impacted all areas of society and will probably transform how …

This concise, accessible text provides a thorough introduction to quantum computing-an
exciting emergent field at the interface of the computer, engineering, mathematical and …

In the near future, there will likely be special-purpose quantum computers with 40-50 high-
quality qubits. This paper lays general theoretical foundations for how to use such devices to …

Abstract In 1950, John Nash sent a remarkable letter to the National Security Agency, in
which—seeking to build theoretical foundations for cryptography—he all but formulated what …

In this paper, a quantum extension of classical deep neural network (DNN) is introduced,
which is called QDNN and consists of quantum structured layers. It is proved that the QDNN …

This paper introduces a novel framework for learning algorithms to solve online
combinatorial optimization problems. Towards this goal, we introduce a number of key ideas …

We describe a computational problem that is complete for the complexity class QMA, a
quantum generalization of NP. It arises as a natural question in quantum computing and …

Vehicular traffic is attracting a growing scientific interest because of its connections with
other important problems, like, eg, environmental pollution and congestion of cities. Rational …