Skip to main content

Advertisement

Springer Nature Link
Log in

Exact satisfiability and phase transition analysis of the regular (k, d)-CNF formula

  • 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. Fan Y, Shen J. On the phase transitions of random k-constraint satisfaction problems. Artificial Intelligence, 2011, 175(3–4): 914–927

    MathSciNet  MATH  Google Scholar 

  2. Drori L, Peleg D. Faster solutions for exact hitting and exact SAT. Jerusalem: Weizmann Science Press of Israel, 1999

    MATH  Google Scholar 

  3. Byskov J M, Madsen B A, Skjernaa B. New algorithms for Exact Satisfiability. Theoretical Computer Science, 2005, 332(1–3): 515–541

    MathSciNet  MATH  Google Scholar 

  4. Moore C. The phase transition in random regular exact cover. Annales del’ Institut Henri Poincare D 2016, 3(3): 349–362

    MathSciNet  MATH  Google Scholar 

  5. Mitzenmacher M, Upfal E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge: University of Cambridge, 2005

    MATH  Google Scholar 

Download references

Acknowledgements

This research was funded by the National Natural Science Foundation of China (Grant Nos. 61862051, 62241206 and 62062001), the Science and Technology Plan Project of Guizhou Province (Grant No. Qiankehe Foundation-ZK[2022] General 550).

Author information

Authors and Affiliations

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

    Guoxia Nie, Daoyun Xu & Xi Wang

  2. School of Mathematics and Statistics, Qiannan Normal University for Nationalities, Duyun, 558000, China

    Zaijun Zhang

  3. Key Laboratory of Industrial Automation and Machine Vision of Qiannan, Duyun, 558000, China

    Zaijun Zhang

Authors
  1. Guoxia Nie
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Daoyun Xu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Xi Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Zaijun Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Daoyun Xu.

Ethics declarations

Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.

Electronic Supplementary Material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nie, G., Xu, D., Wang, X. et al. Exact satisfiability and phase transition analysis of the regular (k, d)-CNF formula. Front. Comput. Sci. 18, 181405 (2024). https://doi.org/10.1007/s11704-023-3402-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-023-3402-4