Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

83

Voted

FOCS
2007
IEEE

favoriteEmaildiscussreport

108views Theoretical Computer Science» more FOCS 2007»

Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation

15 years 5 months ago

Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation

Download itcs.tsinghua.edu.cn

Xi Chen, Shang-Hua Teng

Real-time Traffic

FOCS 2007 | Theoretical Computer Science |

claim paper

Related Content

» Quantum Separation of Local Search and Fixed Point Computation

» New upper and lower bounds for randomized and quantum local search

» On the Quantum Query Complexity of Local Search in Two and Three Dimensions

» Optimal Resource Discovery Paths of Gnutella2

» A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Com...

» StaRSaC Stable Random Sample Consensus for Parameter Estimation

» Routing complexity of faulty networks

Post Info
More Details (n/a)

Added	02 Jun 2010
Updated	02 Jun 2010
Type	Conference
Year	2007
Where	FOCS
Authors	Xi Chen, Shang-Hua Teng

Comments (0)