3 ms·
Yes, we don't have good ways to unify the flipping between GF32 and GF2 beyond down-converting to GF2 (which yields a massive increase in clause-complexity). G
by optimiz3 12y ago
Yes, we don't have good ways to unify the flipping between GF32 and GF2 beyond down-converting to GF2 (which yields a massive increase in clause-complexity).
GF32 addition in GF2 basically looks like a giant ripple-carry-adder.
- zvrba 12y ago> GF32 addition in GF2 basically looks like a giant ripple-carry-adder. I tried to implement addition in GF32 through Kogge-Stone adder because the dependency chain has length 5 instead of 32. No success. The intermediate variables got so complex that the BDD library I used at the time couldn't even synthesize the expression for a 32-bit adder.