Universality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems

Universality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems

Random constraint satisfaction problems (CSP) have been studied extensively using statistical physics techniques. They provide a benchmark to study average case scenarios instead of the worst case one. The interplay between statistical physics of disordered systems and computer science has brough...

Full description

Bibliographic Details
Main Author: Silvio Franz, Giorgio Parisi, Maksim Sevelev, Pierfrancesco Urbani, Francesco Zamponi
Format: Article
Language:English
Published: SciPost 2017-06-01
Series:SciPost Physics
Online Access:https://scipost.org/SciPostPhys.2.3.019

Similar Items

Similar Items