MathSciNet Relay Station
MathSciNet bibliographic data
MR1220075 68Q25 (68Q05 94C10)
Borodin, A.; Razborov, A.; Smolensky, R. On lower bounds for read-$k$-times branching programs. Comput. Complexity 3 (1993), no. 1, 1–18.
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