1552 search results - page 151 / 311 » On the Complexity of Constant Propagation |
168
click to vote
TCC
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
175
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
173
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
178
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
170
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...