Covering a set with arithmetic progressions is NP-complete (Q910219)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4139292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering a set with arithmetic progressions is NP-complete |
scientific article; zbMATH DE number 4139292 |
Statements
Covering a set with arithmetic progressions is NP-complete (English)
0 references
1990
0 references
computational complexity
0 references
set covering
0 references
NP-complete
0 references
arithmetic progressions
0 references
0.7495875358581543
0 references
0.7303928136825562
0 references
0.7301191687583923
0 references
0.7253152132034302
0 references
