MathSciNet Relay Station
MathSciNet bibliographic data
MR2145860 90C05 (68W40 90C60)
Spielman, Daniel A.; Teng, Shang-Hua Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM 51 (2004), no. 3, 385–463.
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 2017, American Mathematical Society
Privacy Statement
HTTP/1.1 200 OK Date: Sun, 20 Aug 2017 12:00:16 GMT Server: Apache WWW-Authenticate: Basic realm="MathSciNet Authentication" Set-Cookie: SID=4b2ab632cc53540c95c85f1515c411a0; path=/; expires=Sun, 08-Jun-2031 12:00:16 GMT Content-Language: en Vary: Accept-Encoding,User-Agent Content-Encoding: gzip Keep-Alive: timeout=5, max=98 Connection: Keep-Alive Transfer-Encoding: chunked Content-Type: text/html; charset=UTF-8 53b W{o6)Hȟ6i0Yr* p jO@Hc<\{ҡ0M#rLcT/HU:"sSҌi=R2% Hd \$HhE 0EϨM 9hF"FdM#*%3q-<824B|۸x.<+Yhw6;P% $;x&6&ֽ+=}ߥKzWrNob^ft{__c8xpޒO;U^pqpw..nyߡ&#p lʯe(RDq*Ҏ$8D+-Ax?b`ʪ<,SC4ψݡ.tgB t.IjLD%[M0=jV1j06bv5=9(4㓗Z TMNN Kl6k4NRO*͗f{`N_OkHZzAH531 #2lOSJ.IԑH~vBsf܅K\"p0Qhy!p-kPOiQA\LytӋfWy+u)cܘI)׋^vi;-u! Re'9QjL1Ҙo3.Z7u$˨GBaPN6nJ]2&orfḀ 9RJ[>N/fe 6f"4}'WwM^XRv9"вawsar=<*C"cK@3 { D9v^y8֖+GAlc>LZaUbk0x^\lQl=A<7!{s k:/3lWk_}q  a IVw 0