We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
—We introduce a new data set which contains both a self-declared friendship network and self-chosen attributes from a finite list defined by the social networking site. We prop...
—Radical change is needed in today’s organizations. While e-mail, instant messaging, wikis, prediction markets, and the like have proliferated across myriad sectors, the fundam...
Taemie Kim, Daniel Olguin Olguin, Benjamin N. Wabe...