Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
2. Beigel, R., Eppstein, D.: 3-coloring in time $$o(1.3446^n)$$: a no-MIS algorithm. In: 36th IEEE Annual Symposium on Foundations of Computer Science, (FOCS), vol. 36, pp. 444–452 (1995)
3. De, A., Etesami, O., Trevisan, L., Tulsiani, M.: Improved pseudorandom generators for depth 2 circuits. In: 13th International Workshop, APPROX, and 14th International Workshop Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, RANDOM, pp. 504–517 (2010)
4. Hertli, T.: 3-SAT faster and simpler–unique-SAT bounds for PPSZ hold in general. SIAM J. Comput. 43(2), 718–729 (2014)
5. Hirsch, E.A.: A fast deterministic algorithm for formulas that have many satisfying assignments. Logic J IGPL 6(1), 59–71 (1998)