Satisfiability threshold of the random regular (s, c, k)-SAT problem

Xiaoling Mo, Daoyun Xu, Kai Yan, Zaijun Zhang. Satisfiability threshold of the random regular (s, c, k)-SAT problem. Frontiers of Computer Science in China, 16(3):163408, 2022. [doi]

@article{MoXYZ22,
  title = {Satisfiability threshold of the random regular (s, c, k)-SAT problem},
  author = {Xiaoling Mo and Daoyun Xu and Kai Yan and Zaijun Zhang},
  year = {2022},
  doi = {10.1007/s11704-022-1741-1},
  url = {https://doi.org/10.1007/s11704-022-1741-1},
  researchr = {https://researchr.org/publication/MoXYZ22},
  cites = {0},
  citedby = {0},
  journal = {Frontiers of Computer Science in China},
  volume = {16},
  number = {3},
  pages = {163408},
}