Search papers, labs, and topics across Lattice.
Indian Institute of Technology Goa
1
0
2
BNN satisfiability is NP-complete, but robustness verification can be achieved in polynomial time through clever structural insights.
