Determining the parity of NAND tree contraction outcomes
When computing the parity of a counting problem, a comon technique is to consider swapping two elements. If the first two edges selected do not intersect, swapping thier order does not chenge the result. Only intersecting cases must be considered. For adjacent edges y---x---z, contracting in the two...