In this paper, a new iterative adaptive dynamic programming (ADP) method is proposed to
solve a class of continuous-time nonlinear two-person zero-sum differential games. The idea …

The primary goal of this paper is to define and study the interactive information complexity of
functions. Let f (x, y) be a function, and suppose Alice is given x and Bob is given y …

This monograph presents techniques to approximate real functions such as xs; x–1 and e–x
by simpler functions and shows how these results can be used for the design of fast …

Quantum information and computation provide a fascinating twist on the notion of proofs in
computational complexity theory. For instance, one may consider a quantum computational …

This work considers the quantum interactive proof system model of computation, which is the
(classical) interactive proof system model's natural quantum computational analogue. An …

A strong direct product theorem (SDPT) states that solving n instances of a problem requires
Omega (n) times the resources for a single instance, even to achieve success probability 2 …

We study the design of polylogarithmic depth algorithms for approximately solving packing
and covering semidefinite programs (or positive SDPs for short). This is a natural SDP …

The interactive proof system model of computation has been studied extensively in
computational complexity theory and theoretical cryptography for more than 25 years, and …

A strong direct product theorem for a problem in a given model of computation states that, in
order to compute k instances of the problem, if we provide resource which is less than k …

We define a new notion of information cost for quantum protocols, and a corresponding
notion of quantum information complexity for bipartite quantum tasks. These are the fully …