Login / Signup

The Number of Satisfying Assignments of Random Regular k-SAT Formulas.

Amin Coja-OghlanNick Wormald
Published in: Comb. Probab. Comput. (2018)
Keyphrases
  • search algorithm
  • computational complexity
  • upper bound
  • small number
  • database
  • real time
  • randomly generated