Author:
Vyas Nikhil,Williams Ryan
Publisher
Springer International Publishing
Reference24 articles.
1. Achlioptas, D., Coja-Oghlan, A.: Algorithmic barriers from phase transitions. In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 793–802. IEEE (2008)
2. Ben-Sasson, E., Bilu, Y., Gutfreund, D.: Finding a randomly planted assignment in a random 3CNF (2002, manuscript)
3. Brakensiek, J., Guruswami, V.: Bridging between 0/1 and linear programming via random walks. CoRR abs/1904.04860 (2019). http://arxiv.org/abs/1904.04860
4. Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique k-SAT: an isolation lemma for k-CNFs. J. Comput. Syst. Sci. 74(3), 386–393 (2008)
5. Lecture Notes in Computer Science;C Calabro,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems;ACM Transactions on Computation Theory;2022-03-31
2. PPSZ is better than you think;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02