71 search results - page 11 / 15 » focs 2009 |
127
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
140
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
119
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
167
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
134
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...