Skip to main content
Springer Nature Link
Log in

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

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Fu Z, Xu D. Uniquely satisfiable d-regular (k, s)-SAT instances. Entropy, 2020, 22(5): 569

    Article  MathSciNet  Google Scholar 

  2. Wang Y, Xu D. Properties of the satisfiability threshold of the strictly d-regular random (3,2s)-SAT problem. Frontiers of Computer Science, 2020, 14(6): 146404

    Article  Google Scholar 

  3. Mitzenmacher M, Upfal E. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. 2nd ed. Cambridge: Cambridge University Press, 2017

    MATH  Google Scholar 

  4. Flajolet P, Sedgewick R. Analytic Combinatorics. Cambridge: Cambridge University Press, 2009

    Book  MATH  Google Scholar 

  5. Boufkhad Y, Dubois O, Interian Y. Regular random k-SAT: properties of balanced formulas. Journal of Automated Reasoning, 2005, 35(1–3): 181–200

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research was funded by the National Natural Science Foundation of China (Grant Nos. 61762019, 61862051 and 62062001). The Science and Technology Foundation of Guizhou Province (Qian Ke Ping Tai Ren Cai [2019] QNSYXM-05).

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Guizhou University, Guiyang, 550025, China

    Xiaoling Mo, Daoyun Xu & Zaijun Zhang

  2. Agricultural Development Bank of China, Beijing, 100045, China

    Kai Yan

  3. Key Laboratory of Complex Systems and Intelligent Computing and School of Mathematics and Statistics, Qiannan Normal University for Nationalities, Duyun, 558000, China

    Zaijun Zhang

Authors
  1. Xiaoling Mo
    View author publications

    Search author on:PubMed Google Scholar

  2. Daoyun Xu
    View author publications

    Search author on:PubMed Google Scholar

  3. Kai Yan
    View author publications

    Search author on:PubMed Google Scholar

  4. Zaijun Zhang
    View author publications

    Search author on:PubMed Google Scholar

Corresponding author

Correspondence to Daoyun Xu.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mo, X., Xu, D., Yan, K. et al. Satisfiability threshold of the random regular (s, c, k)-SAT problem. Front. Comput. Sci. 16, 163408 (2022). https://doi.org/10.1007/s11704-022-1741-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-022-1741-1