XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem
| dc.creator | Chen, Jing-Chao | |
| dc.date | 2007-03-02 | |
| dc.date.accessioned | 2026-07-07T07:49:51Z | |
| dc.date.available | 2026-07-07T07:49:51Z | |
| dc.description | The DIMACS 32-bit parity problem is a satisfiability (SAT) problem hard to solve. So far, EqSatz by Li is the only solver which can solve this problem. However, This solver is very slow. It is reported that it spent 11855 seconds to solve a par32-5 instance on a Maxintosh G3 300 MHz. The paper introduces a new solver, XORSAT, which splits the original problem into two parts: structured part and random part, and then solves separately them with WalkSAT and an XOR equation solver. Based our empirical observation, XORSAT is surprisingly fast, which is approximately 1000 times faster than EqSatz. For a par32-5 instance, XORSAT took 2.9 seconds, while EqSatz took 2844 seconds on Intel Pentium IV 2.66GHz CPU. We believe that this method significantly different from traditional methods is also useful beyond this domain. | |
| dc.identifier | https://arxiv.org/abs/cs/0703006 | |
| dc.identifier | http://arxiv.org/abs/cs/0703006 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/124971 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem | |
| dc.type | text |