FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
FOCS
2009
IEEE
13 years 11 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...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
FOCS
2009
IEEE
13 years 11 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...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...