MathSciNet Relay Station
MathSciNet bibliographic data
MR1934958 (2003i:68047) 68Q25 (90C15)
Cocco, Simona; Monasson, RĂ©mi Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions. Phys. Rev. E (3) 66 (2002), no. 3, 037101, 4 pp.
Article
 
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2014, American Mathematical Society
Privacy Statement