Self-testing is a method to infer the underlying physics of a quantum experiment in a black
box scenario. As such it represents the strongest form of certification for quantum systems. In …

A reflection of our ultimate understanding of a complex system is our ability to control its
behavior. Typically, control has multiple prerequisites: it requires an accurate map of the …

Verifying the robustness property of a general Rectified Linear Unit (ReLU) network is an NP-
complete problem. Although finding the exact minimum adversarial distortion is hard, giving …

Note from the Research Highlights Co-Chairs: A Research Highlights paper appearing in
Communications is usually peer-reviewed prior to publication. The following paper is …

On-demand systems in which passengers with similar routes can share a vehicle are
expected to become a relevant part of future mobility, thanks to their flexibility and their …

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 …

We show that every language in NP has a probablistic verifier that checks membership
proofs for it using logarithmic number of random bits and by examining a constant number of …

Many problems in artificial intelligence require adaptively making a sequence of decisions
with uncertain outcomes under partial observability. Solving such stochastic optimization …

We give a new characterization of NP: the class NP contains exactly those languages L for
which membership proofs (a proof that an input x is in L) can be verified probabilistically in …