100
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose d...
109
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
The problem of finding a maximum cardinality stable matching in the presence of ties and unacceptable partners, called MAX SMTI, is a well-studied NP-hard problem. The MAX SMTI i...
114
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
An instance of the 2-Lin(2) problem is a system of equations of the form “xi + xj = b (mod 2)”. Given such a system in which it’s possible to satisfy all but an fraction of ...