Some Polynomial and Integer Divisibility Problems are NP-Hard

DOI10.1137/0207036MaRDI QIDQ4167579zbMATH OpenOpenAlexFDO

Authors David A. Plaisted

Publication date 1978

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0207036

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(3)

• New NP-hard and NP-complete polynomial and integer divisibility problems
• Methodologies of Symbolic Computation
• Complete divisibility problems for slowly utilized oracles

This page was built for publication: Some Polynomial and Integer Divisibility Problems are $NP$-Hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167579)