Table 3 Clause densities across problem representations

From: Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing

Class

CNF

CNF-PP

XNF

XNF-PP

 

\({k}_{\max }\)

dCNF

dXOR

\({k}_{\max }\)

dCNF

dXOR

\({k}_{\max }\)

dCNF

dXOR

\({k}_{\max }\)

dCNF

dXOR

McEliece

3

1.55

–

5

2.56

–

13

1.93

3.44

13

10.31

18.97

MDP

3

2.52

–

6

2.97

–

13

4.17

7.90

15

9.28

13.57

AES

5

0.82

–

5

0.97

–

14

1.43

3.57

12

3.25

5.16

  1. Maximum number of literals per clause \({k}_{\max }\) and average clause densities (in %) dCNF/XOR for CNF and XOR clauses for the different problem representations
Back to article page