Ask HN: Has this open math problem received attention from computer scientists?

Define a covering to be a set of residue classes a (mod m) such that all the integers are covered.

Example: 0 (mod 2), 0 (mod 3), 1 (mod 4), 5 (mod 6), 7 (mod 12) is a covering, because every integer belongs to one of these five residue classes.

Here are two famous open problems, due to Paul Erdos and John Selfridge.

(1) For each integer N, does there exist a covering where the moduli are all distinct integers at least N?

(2) Does there exist a covering where the moduli are all distinct odd integers (excluding 1)?

I just listened to a math seminar talk on the subject. Apparently most work on the subject involves a lot of brute force and consideration of special cases, see e.g. [1].

To me, this seems like more of a CS problem than a math problem. My colleagues didn't really believe me, but my optimism wasn't deterred. That said, I only have a little CS background. I wonder if there exist algorithmic approaches to the problem, using perhaps advanced techniques from AI such as neural nets.

Do any HN readers know of any work done on this problem from an algorithmic perspective, or know enough to express optimism or pessimism with any authority?

Thanks to all.

[1] http://www.wiskundemeisjes.nl/wp-content/uploads/2009/02/sdarticle.pdf