Affiliation:
1. AT&T Labs -- Research, Florham Park, New Jersey
Abstract
This is the 24th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., New York, 1979, hereinafter referred to as “[G&J].”” Previous columns, the first 23 of which appeared in
J. Algorithms
, will be referred to by a combination of their sequence number and year of appearance, e.g. “[Col 1, 1981].” This edition of the column describes the history and purpose of the column and the status of the open problems from [G&J] and previous columns.
Publisher
Association for Computing Machinery (ACM)
Subject
Mathematics (miscellaneous)
Reference89 articles.
1. Aaronson S. 2003. The prime facts: From Euclid to AKS. Manuscript available from http://www. scottaaronson.com/writings/prime.pdf. Aaronson S. 2003. The prime facts: From Euclid to AKS. Manuscript available from http://www. scottaaronson.com/writings/prime.pdf.
2. On Distinguishing Prime Numbers from Composite Numbers
3. Agrawal M. Kayal N. and Saxena N. 2002. PRIMES is in P. Manuscript available from http:// www.cse.iitk.ac.in/primality.pdf. Agrawal M. Kayal N. and Saxena N. 2002. PRIMES is in P. Manuscript available from http:// www.cse.iitk.ac.in/primality.pdf.
4. PRIMES is in P
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献