default search action
"Some Polynomial and Integer Divisibility Problems Are NP-Hard"
David A. Plaisted (1976)
- David A. Plaisted:
Some Polynomial and Integer Divisibility Problems Are NP-Hard. FOCS 1976: 264-267
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.