البيان رقم صفر

Proceedings of the third annual ACM symposium on Theory of computing

Backlinks

Reference. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time

6 July 2001

Reference. On complexity as bounded rationality (extended abstract)

23 May 1994

Reference. The complexity of theorem-proving procedures

3 May 1971