Some Polynomial and Integer Divisibility problems are NP-Hard - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

David A. Plaisted. Some Polynomial and Integer Divisibility problems are NP-Hard. SIAM Journal on Computing, 7(4):458-464, 1978.

@article{Plaisted78,
  title = {Some Polynomial and Integer Divisibility problems are NP-Hard},
  author = {David A. Plaisted},
  year = {1978},
  researchr = {https://researchr.org/publication/Plaisted78},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {7},
  number = {4},
  pages = {458-464},
}

runs on WebDSL