FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory li...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...