البيان رقم صفر

Home

❯

refs

❯

Faster k-SAT algorithms using biased-PPSZ

Faster k-SAT algorithms using biased-PPSZ

Hansen, Thomas Dueholm, Haim Kaplan, Or Zamir, and Uri Zwick, ‘SAT’: ‘Faster k-SAT algorithms using biased-PPSZ’, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, New York, NY, USA: Association for Computing Machinery, 23 June 2019, pp 578–589.

conference paper · https://doi.org/10.1145/3313276.3316359


Graph View

Backlinks

  • Thomas Dueholm Hansen
  • Haim Kaplan
  • Or Zamir
  • Uri Zwick
  • Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
  • The asymptotics of language