3228 search results - page 343 / 646 » Computationally Sound Proofs |
122
click to vote
ICDCS
2003
IEEE
15 years 9 months ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
148
click to vote
EUROCRYPT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Recently, methods from provable security, that had been developped for the last twenty years within the research community, have been extensively used to support emerging...
131
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
136
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
117
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...