SciPost: Latest Submissions in Computational Complexityhttps://scipost.org/submissions/2019-10-23T00:00:00+02:00SciPostSciPost: most recent submissions in Computational ComplexityFast counting with tensor networks, by Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
2019-10-23T00:00:00+02:00https://scipost.org/submissions/scipost_201908_00005v3/Submitted on 2019-10-23, refereeing deadline 2019-11-21.
Fast counting with tensor networks, by Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
2019-08-05T00:00:00+02:00https://scipost.org/submissions/scipost_201908_00005v1/Submitted on 2019-08-05, refereeing deadline 2019-10-23.
Universality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems, by Silvio Franz, Giorgio Parisi, Maksim Sevelev, Pierfrancesco Urbani, Francesco Zamponi
2017-05-02T00:00:00+02:00https://scipost.org/submissions/1702.06919v2/Submitted on 2017-05-02, refereeing deadline 2017-05-30.
Universality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems, by Silvio Franz, Giorgio Parisi, Maksim Sevelev, Pierfrancesco Urbani, Francesco Zamponi
2017-02-25T00:00:00+01:00https://scipost.org/submissions/1702.06919v1/Submitted on 2017-02-25, refereeing deadline 2017-04-24.