A boolean function f on N variables is called evasive if its decision tree complexity is N, i.e., one must query *all* the variables (in worst case) in order to decide if f(X) = 1.
I propose to give a series of lectures explaining the recent paper by Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and John Watrous showing that the class of problems having quantum interactive proofs is the same as the class of problems having cla
The torus is one of the most important geometrical objects in mathematics. As a topological space it is just a product of two circles. The is a natural continuous mapping from the real plane to the torus which is called the exponential map.
Lately, there has been a considerable amount of interest in design methodologies for embedded systems that are specifically targeted towards stream processing, e.g., audio/video applications and control applications processing sensor data.
A path from $s$ to $t$ on a polyhedral terrain is descending if the height of a point $p$ never increases while we move p along the path from $s$ to $t$.
Cloud Computing has recently received more attention than many exciting Page 3 notables. It is a model of distributed computation which promises to provide huge benefits to application providers and their users.
Suppose there is a graph G, whose vertices are letters in an alphabet A and in which adjacency means that the letters can be confused in a transmission.
We survey the classical multi-armed bandit problem and discuss several variations such as the problem of stochastic search in a forest and the union branching bandit problem.
