IRREDUCIBILITY TESTING AND FACTORIZATION OF POLYNOMIALS.

Leonard M. Adleman, Andrew M. Odlyzko

Research output: Contribution to journal › Conference article › peer-review

3 Scopus citations

Original language	English (US)
Pages (from-to)	409-418
Number of pages	10
Journal	Annual Symposium on Foundations of Computer Science - Proceedings
DOIs	https://doi.org/10.1109/sfcs.1981.20
State	Published - 1981

Access

@article{83fd46f16e244a4dba360c46245ee623,

title = "IRREDUCIBILITY TESTING AND FACTORIZATION OF POLYNOMIALS.",

author = "Adleman, {Leonard M.} and Odlyzko, {Andrew M.}",

year = "1981",

doi = "10.1109/sfcs.1981.20",

language = "English (US)",

pages = "409--418",

journal = "Annual Symposium on Foundations of Computer Science - Proceedings",

issn = "0272-5428",

}

TY - JOUR

T1 - IRREDUCIBILITY TESTING AND FACTORIZATION OF POLYNOMIALS.

AU - Adleman, Leonard M.

AU - Odlyzko, Andrew M.

PY - 1981

Y1 - 1981

UR - http://www.scopus.com/inward/record.url?scp=0019651606&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019651606&partnerID=8YFLogxK

U2 - 10.1109/sfcs.1981.20

DO - 10.1109/sfcs.1981.20

M3 - Conference article

AN - SCOPUS:0019651606

SN - 0272-5428

SP - 409

EP - 418

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

ER -