Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
Some Polynomial and Integer Divisibility Problems Are NP-Hard
David A. Plaisted
Venue
A*
FOCS
Year
1976
Proceedings
FOCS
DBLP record
conf/focs/Plaisted76 ↗
Browse the full
FOCS paper archive
.