0 citations0 referencesGoogle Scholardoi.orgDetermining computational complexity from characteristic ‘phase transitions’Nature·1999·Vol. 400(6740), pp. 133–137Citations Over TimeTop 1% of 1999 papersRémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, Lidror TroyanskyRelated Papers→ Determining satisfiability of 3-SAT in polynomial time(2019)→ Improved algorithms for the general exact satisfiability problem(2021)