Timeline for Decide if a system of arithmetic sequences is an $m$-cover of $\mathbb{N}$
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 21, 2018 at 8:52 | vote | accept | Victor | ||
| Oct 21, 2018 at 3:44 | comment | added | Zhi-Wei Sun | @Victor Here I provide you an excellent introductory book to NP-completeness where Stockmeyer and Meyer's result was included: M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman, 1979. ISBN 0-7167-1045-5. | |
| Oct 20, 2018 at 14:09 | comment | added | Victor | Zhi-Wei Sun, thanks for your answer! Unfortunately, I'm not enough familiar with the complexity theory to quickly spot the relevant results. I would be grateful if you could point out which of their problems corresponds to 1-cover and which of the statements proves co-NP-completeness. (I was reading this goo.gl/8HsxQm version of the above paper) | |
| Oct 19, 2018 at 23:54 | history | edited | Zhi-Wei Sun | CC BY-SA 4.0 |
added 83 characters in body
|
| Oct 19, 2018 at 23:45 | history | answered | Zhi-Wei Sun | CC BY-SA 4.0 |