


default search action
"Covering a Set with Arithmetic Progressions is NP-Complete."
Lenwood S. Heath (1990)
- Lenwood S. Heath:
Covering a Set with Arithmetic Progressions is NP-Complete. Inf. Process. Lett. 34(6): 293-298 (1990)

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.