Sign imbalance is a statistic on posets which counts the difference between the number of even and odd linear extensions. We prove complexity results about the sign imbalance and parity of linear extensions, focusing on the representative case of height 2 posets. We then consider a recent conjecture of Chan and Pak.