Some Polynomial and Integer Divisibility Problems are $NP$-Hard

DOI10.1137/0207036zbMath0386.68049OpenAlexW2029244876MaRDI QIDQ4167579

David Alan 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)

Related Items

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