Bell's 1964 theorem, which states that the predictions of quantum theory cannot be
accounted for by any local theory, represents one of the most profound developments in the …

Semidefinite programs are convex optimization problems involving a linear objective
function and a domain of positive-semidefinite matrices. Over the past two decades, they …

There is an increasing interest in quantum algorithms for problems of integer programming
and combinatorial optimization. Classical solvers for such problems employ relaxations …

This paper investigates various aspects of the nonlocal effects that can arise when
entangled quantum information is shared between two parties. A natural framework for …

The weighted MAX k k-CUT problem consists of finding ak-partition of a given weighted
undirected graph G (V, E), such that the sum of the weights of the crossing edges is …

In video sequences, human action recognition is a challenging problem due to motion
variation, in frame person difference, and setting of video recording in the field of computer …

The classical PCP theorem is arguably the most important achievement of classical
complexity theory in the past quarter century. In recent years, researchers in quantum …

Combinatorial problems are formulated to find optimal designs within a fixed set of
constraints and are commonly found across diverse engineering and scientific domains …

In many areas of applied mathematics, decentralization of information is a ubiquitous
attribute affecting how to approach a stochastic optimization, decision and estimation, or …