Sciweavers

STOC
2012
ACM
193views Algorithms» more  STOC 2012»
13 years 8 months ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright
190
Voted
STOC
2012
ACM
243views Algorithms» more  STOC 2012»
13 years 8 months ago
Budget feasible mechanism design: from prior-free to bayesian
Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu
172
Voted
STOC
2012
ACM
203views Algorithms» more  STOC 2012»
13 years 8 months ago
Fast matrix rank algorithms and applications
Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
13 years 8 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
13 years 8 months ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...