We prove that two general versions of optimal k-anonymization of relations are NP-hard, including the suppression version which amounts to choosing a minimum number of entries to delete from the relation.Expand

We define a notion of sub cubic reducibility, and show that many important problems on graphs and matrices solvable in O(n^3) time are equivalent under sub cubic reductions.Expand

We present a novel method for exactly solving (in fact, counting solutions to) general constraint satisfaction optimization with at most two variables per constraint (e.g. MAX-2-SAT and MAX-CUT).Expand

The Food, Conservation, and Energy Act of 2008 directed the U.S. Department of Agriculture to conduct a 1-year study to assess the extent of areas with limited access to affordable and nutritious… Expand

This paper tests the proposition that higher tournament incentives will result in greater risk-taking by senior managers in order to increase their chance of promotion to the rank of CEO. Measuring… Expand

We describe reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural algorithmic problems, where attaining any of the following bounds would improve the state of the art in algorithms for SAT.Expand

The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD$m$ gates, where $m > 1$ is an arbitrary constant.Expand

We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two n × n matrices, yielding a faster algorithm for solving the all-pairs shortest path problem (APSP) in dense n-node directed graphs with arbitrary edge weights.Expand