92 search results - page 19 / 19 » Nonlinearity Bounds and Constructions of Resilient Boolean F... |
ECCC
2007
13 years 4 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
TSMC
2010
12 years 11 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...