87 search results - page 10 / 18 » focs 2008 |
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
FOCS
2008
IEEE
13 years 12 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...