Hi, WeWe say that a boolean circuit is boring whenif it returntsreturns the same result for $>\frac34$ possible input, where we have $n$ input gates. Hence, boring circuit returns the same output ($0$ or $1$) for $>\frac34 2^n$ inputs. Prove that checking if boolean circuit is boring is NP-complete
Can you help me ? I have no idea how to start. I tried to reduce $3$-SAT but no result.