MathSciNet Relay Station
MathSciNet bibliographic data
MR1715604 68Q25 (68Q15)
Beame, Paul; Karp, Richard; Pitassi, Toniann; Saks, Michael On the complexity of unsatisfiability proofs for random $k$-CNF formulas. STOC '98 (Dallas, TX), 561–571, ACM, New York, 1999.
Links to the journal or article are not yet available
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