IRREDUCIBILITY TESTING AND FACTORIZATION OF POLYNOMIALS.

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	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOIs	https://doi.org/10.1109/sfcs.1981.20
State	Published - 1981

Publisher link

@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 = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

issn = "0272-5428",

publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - IRREDUCIBILITY TESTING AND FACTORIZATION OF POLYNOMIALS.

AU - Adleman, Leonard M.

AU - Odlyzko, Andrew M.

PY - 1981

Y1 - 1981

UR - https://www.scopus.com/pages/publications/0019651606

UR - https://www.scopus.com/pages/publications/0019651606#tab=citedBy

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 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

ER -