Participants Info
| Name | Ximing Fu, Chenhao Wu, Tianshuo Cong, Xiaoyun Wang |
|---|---|
| Institute |
Submission Details
| Date | 2019/09/14 |
|---|---|
| Type | IV |
| Number of variables (n) | 93 |
| Number of equations (m) | 62 |
| Seed (0,1,2,3,4) | 1 |
| Algorithm | A new algorithm |
| Hardware | A cluster of Intel Xeon @ 2.6 Ghz |
| Running Time | 18477s on 300 Cores |
| Answer v=[v1,…,vn] in Fn | [1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] |
| Notes | A paper describing the method is in preparation. There is no solution if fixing the high 31 bits with zeros, hence the solution was found after exploring 150% of the expected total space. |