Robuta

Members Seminars Papers

We present a gap theorem regarding the complexity of the circuit satisfiability problem.We prove that the success probability of deciding Circuit...

Let $CC_{o(n)} \left[ m \right]$ be the class of circuits that have size $o(n)$ and in which all gates are $MOD_m$ gates.