{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:07Z","timestamp":1740169207784,"version":"3.37.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762019","61862051","62062001"],"award-info":[{"award-number":["61762019","61862051","62062001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3057858","type":"journal-article","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T07:23:42Z","timestamp":1612855422000},"page":"26664-26673","source":"Crossref","is-referenced-by-count":1,"title":["The Phase Transition Analysis for Random Regular Exact (s, c, k)\u2014SAT Problem"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0070-1061","authenticated-orcid":false,"given":"Xiaoling","family":"Mo","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Guizhou University, Guiyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoyun","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Guizhou University, Guiyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Guizhou University, Guiyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2017.2736504"},{"key":"ref11","first-page":"721","article-title":"The phase transition in 1-in-k SAT and NAE 3-SAT","volume":"1","author":"achlioptas","year":"2001","journal-title":"ACM Symp Discrete Algorithms"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703434231"},{"key":"ref13","first-page":"814","article-title":"Satisfiability threshold for random regular NAE-SAT","volume":"341","author":"jian","year":"2014","journal-title":"Commun Math Phys"},{"key":"ref14","first-page":"1","article-title":"Satisfiability thresholds for regular occupation Problems","volume":"90","author":"pasch","year":"2019","journal-title":"Proc Int Colloq Automata Lang Program"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/cjtcs.2008.005","volume":"14","author":"kalapala","year":"2008","journal-title":"Chicago J Theor Comput Sci"},{"key":"ref16","first-page":"349","article-title":"The phase transition in random regular exact cover","volume":"3","author":"moore","year":"2016","journal-title":"Ann Inst Henri Poincare&#x00B4"},{"key":"ref17","first-page":"239","article-title":"Models of random regular graphs","volume":"267","author":"wormald","year":"1999","journal-title":"Surveys in Combinatorics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2018.05.029"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-018-3096-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20104"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.11.004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/12090191X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.02.020"},{"key":"ref8","first-page":"1","article-title":"The satisfiability threshold of random 3-SAT Is at least 3.52","author":"hajiaghayi","year":"2003","journal-title":"Mathematics in Computer Science"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20090"},{"key":"ref2","first-page":"1113","article-title":"NP-completeness of d-regular (k, s)-SAT problem","volume":"31","author":"zf","year":"2020","journal-title":"Ruan Jian Xue Bao Journal of Software"},{"key":"ref1","first-page":"691","article-title":"A regular NP-complete problem and its inaproximability","volume":"7","author":"xu","year":"2013","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20057"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.37236\/6361"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aa9529"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09350258.pdf?arnumber=9350258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:52:25Z","timestamp":1662670345000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9350258\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3057858","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}