Search Results for author: Shijie Bian

Found 2 papers, 1 papers with code

Transformers satisfy

no code implementations1 Jan 2021 Feng Shi, Chen Li, Shijie Bian, Yiqiao Jin, Ziheng Xu, Tian Han, Song-Chun Zhu

The Propositional Satisfiability Problem (SAT), and more generally, the Constraint Satisfaction Problem (CSP), are mathematical questions defined as finding an assignment to a set of objects that satisfies a series of constraints.

Cannot find the paper you are looking for? You can Submit a new open access paper.