{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:32:26Z","timestamp":1758393146735,"version":"3.37.3"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100001809","name":"National natural science fund of China","doi-asserted-by":"crossref","award":["61702019"],"award-info":[{"award-number":["61702019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2019,2]]},"abstract":"<jats:p> Super solution is a notion introduced to produce robust and stable solutions of combinatorial optimization and decision problems. We consider the [Formula: see text]-super solutions of random instances of [Formula: see text]-SAT, where a clause is satisfied if and only if there are at least two satisfied literals in this clause. By using an enhanced weighting scheme, we obtain better lower bounds that, if a random [Formula: see text]-CNF formula [Formula: see text] is [Formula: see text]-unsatisfiable with probability tending to 1 as [Formula: see text], then [Formula: see text] for [Formula: see text], respectively. <\/jats:p>","DOI":"10.1142\/s0129054119500035","type":"journal-article","created":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T23:51:51Z","timestamp":1552434711000},"page":"247-254","source":"Crossref","is-referenced-by-count":4,"title":["On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT"],"prefix":"10.1142","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7290-5579","authenticated-orcid":false,"given":"Guangyan","family":"Zhou","sequence":"first","affiliation":[{"name":"Department of Mathematics, Beijing Technology and Business University, Beijing 100048, P. R. China"}]},{"given":"Rui","family":"Kang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Beijing Technology and Business University, Beijing 100048, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2019,3,12]]},"reference":[{"key":"S0129054119500035BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00154-2"},{"key":"S0129054119500035BIB003","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-04-00464-3"},{"key":"S0129054119500035BIB004","first-page":"620","author":"Chv\u00e1tal V.","year":"1992","journal-title":"Foundations of Computer Science"},{"key":"S0129054119500035BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.02.020"},{"key":"S0129054119500035BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0017-3"},{"key":"S0129054119500035BIB008","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0081"},{"key":"S0129054119500035BIB011","first-page":"157","author":"Hebrard E.","year":"2004","journal-title":"Integration of AI and or Techniques in Constraint Programming"},{"key":"S0129054119500035BIB012","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P"},{"key":"S0129054119500035BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00462-7"},{"key":"S0129054119500035BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-5526-8"},{"key":"S0129054119500035BIB016","doi-asserted-by":"publisher","DOI":"10.1038\/22055"},{"key":"S0129054119500035BIB017","first-page":"287","volume":"17","author":"Vorobyer F. Y.","year":"2007","journal-title":"Discrete Math. Appl."},{"key":"S0129054119500035BIB018","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.tcs.2016.04.041","volume":"657","author":"Zhang P.","year":"2016","journal-title":"Theoretical Computer Science"},{"key":"S0129054119500035BIB019","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054113500251"},{"key":"S0129054119500035BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9731-3"},{"key":"S0129054119500035BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2015.09.015"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054119500035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:40:19Z","timestamp":1565106019000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054119500035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":16,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2019,3,12]]},"published-print":{"date-parts":[[2019,2]]}},"alternative-id":["10.1142\/S0129054119500035"],"URL":"https:\/\/doi.org\/10.1142\/s0129054119500035","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}