Participants Info
Name | Charles Bouillaguet and Julia Sauvage |
---|---|
Institute | Sorbonne Université, CNRS, LIP6 |
Submission Details
Date | 2023/07/07 |
---|---|
Type | I |
Number of variables (n) | 80 |
Number of equations (m) | 160 |
Seed (0,1,2,3,4) | 0 |
Algorithm | https://gitlab.lip6.fr/almasty/hpXbred |
Hardware | 2048 AMD EPYC 7J13 cores on the Oracle public cloud |
Running Time | 370,000 CPU.h in total (182h on 2048 cores) |
Answer v=[v1,…,vn] in Fn | [1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1] |
Notes |
72% of the search space was explored. Going to 100% would have required 32 additional hours. The computation was done on the Oracle public cloud, using Oracle Cloud credits and related resources provided by the Oracle for Research program. It used 128 instances of type VM.Standard.E4.Flex with 16 virtual cores. |