nical Abstract Optimization is to find the "best" solution to a problem where the quality of a solution can be measured by a given criterion. Estimation of Distribution A...
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...