Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Selection of resources for execution of scientific workflows in data grids becomes challenging with the exponential growth of files as a result of the distribution of scientific e...
r of Unentanglement (Extended Abstract) Scott Aaronson MIT Salman Beigi MIT Andrew Drucker MIT Bill Fefferman University of Chicago Peter Shor MIT The class QMA (k), introduced by...
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill...
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...