Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference62 articles.
1. Dimitris Achlioptas (2009). Handbook of Satisfiability, chapter Random Satisfiability, 243–268. IOS Press.
2. Dimitris Achlioptas & Federico Ricci-Tersenghi (2006). On the solution-space geometry of random constraint satisfaction problems. In 38th Annual ACM Symposium on Theory of Computing, Jon M. Kleinberg, editor, 130–139. ACM Press, Seattle, Washington, USA.
3. Miklós Ajtai & Cynthia Dwork (1997). A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence. In 29th Annual ACM Symposium on Theory of Computing, 284–293. ACM Press, El Paso, Texas, USA.
4. Michael Alekhnovich (2003). More on Average Case vs Approximation Complexity. In 44th Annual Symposium on Foundations of Computer Science, 298–307. IEEE Computer Society Press, Cambridge, Massachusetts, USA.
5. Michael Alekhnovich, Edward A. Hirsch & Dmitry Itsykson (2005). Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. J. Autom. Reasoning 35(1–3), 51–72.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献