Sciweavers

71 search results - page 6 / 15
» focs 2009
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
FOCS
2009
IEEE
14 years 3 months ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
FOCS
2009
IEEE
14 years 3 months ago
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
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...
Vitaly Feldman
FOCS
2009
IEEE
14 years 3 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
FOCS
2009
IEEE
14 years 3 months ago
Bit Encryption Is Complete
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
Steven Myers, Abhi Shelat