{"id":"https://openalex.org/W2404909759","doi":"https://doi.org/10.1137/16m1078471","title":"On the Complexity of Random Satisfiability Problems with Planted Solutions","display_name":"On the Complexity of Random Satisfiability Problems with Planted Solutions","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2404909759","doi":"https://doi.org/10.1137/16m1078471","mag":"2404909759"},"language":"en","primary_location":{"id":"doi:10.1137/16m1078471","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1078471","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1311.4821","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054675941","display_name":"Vitaly Feldman","orcid":"https://orcid.org/0000-0002-3904-759X"},"institutions":[{"id":"https://openalex.org/I4210085935","display_name":"IBM Research - Almaden","ror":"https://ror.org/005w8dd04","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210085935","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vitaly Feldman","raw_affiliation_strings":["IBM Research- Almaden"],"affiliations":[{"raw_affiliation_string":"IBM Research- Almaden","institution_ids":["https://openalex.org/I4210085935"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010848870","display_name":"Will Perkins","orcid":"https://orcid.org/0000-0002-7937-7016"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Will Perkins","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101983359","display_name":"Santosh Vempala","orcid":"https://orcid.org/0000-0002-3779-433X"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santosh Vempala","raw_affiliation_strings":["#N#\u2021#N#Georgia Institute of Technology#N#"],"affiliations":[{"raw_affiliation_string":"#N#\u2021#N#Georgia Institute of Technology#N#","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054675941"],"corresponding_institution_ids":["https://openalex.org/I4210085935"],"apc_list":null,"apc_paid":null,"fwci":0.1658,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.40570946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"47","issue":"4","first_page":"1294","last_page":"1338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9632999897003174,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9632999897003174,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.963100016117096,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9628999829292297,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7056275606155396},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5235249996185303},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4550429880619049},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4454631209373474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42560896277427673},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39003539085388184},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.362676203250885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26369476318359375}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7056275606155396},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5235249996185303},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4550429880619049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4454631209373474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42560896277427673},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39003539085388184},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.362676203250885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26369476318359375}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1137/16m1078471","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1078471","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1311.4821","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1311.4821","pdf_url":"https://arxiv.org/pdf/1311.4821","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2951437959","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1311.4821.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.471.319","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.471.319","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://researcher.watson.ibm.com/researcher/files/us-vitaly/FPV_PlantedSAT.0714.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/7fb53c6e-0e81-4e17-acbd-b02cb47ad3cf","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/7fb53c6e-0e81-4e17-acbd-b02cb47ad3cf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Feldman, V, Perkins, W & Vempala, S 2018, 'On the Complexity of Random Satisfiability Problems with Planted Solutions', SIAM Journal on Computing, vol. 47, no. 4, pp. 1294\u20131338. https://doi.org/10.1137/16M1078471","raw_type":"article"},{"id":"doi:10.48550/arxiv.1311.4821","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1311.4821","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2404909759","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc21.html#FeldmanPV14","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1311.4821","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1311.4821","pdf_url":"https://arxiv.org/pdf/1311.4821","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7057023616","display_name":null,"funder_award_id":"1217793","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7817755450","display_name":null,"funder_award_id":"CCF-1217793","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1561953468","https://openalex.org/W1601301932","https://openalex.org/W1974967023","https://openalex.org/W1985123706","https://openalex.org/W1992208280","https://openalex.org/W1995897489","https://openalex.org/W2010271471","https://openalex.org/W2010549883","https://openalex.org/W2011639573","https://openalex.org/W2024060531","https://openalex.org/W2028995298","https://openalex.org/W2040072977","https://openalex.org/W2047836642","https://openalex.org/W2049633694","https://openalex.org/W2050572571","https://openalex.org/W2069730673","https://openalex.org/W2072802070","https://openalex.org/W2080793500","https://openalex.org/W2082618810","https://openalex.org/W2083875149","https://openalex.org/W2090190190","https://openalex.org/W2098180694","https://openalex.org/W2098809394","https://openalex.org/W2110871651","https://openalex.org/W2125123691","https://openalex.org/W2131991992","https://openalex.org/W2152977846","https://openalex.org/W2154061444","https://openalex.org/W2167681887","https://openalex.org/W2168290833","https://openalex.org/W2179897858","https://openalex.org/W2201698373","https://openalex.org/W2284855724","https://openalex.org/W2334237942","https://openalex.org/W2415206359","https://openalex.org/W2529974411","https://openalex.org/W2546502841","https://openalex.org/W2607171573","https://openalex.org/W2963383801","https://openalex.org/W2964292545","https://openalex.org/W2988890240","https://openalex.org/W3162278033","https://openalex.org/W3184572569","https://openalex.org/W4252323760"],"related_works":["https://openalex.org/W2963044240","https://openalex.org/W2963167765","https://openalex.org/W2465777889","https://openalex.org/W3176904788","https://openalex.org/W1564510429","https://openalex.org/W1501879065","https://openalex.org/W217540047","https://openalex.org/W2097890626","https://openalex.org/W2376287672","https://openalex.org/W2998053307","https://openalex.org/W2171033649","https://openalex.org/W3198794542","https://openalex.org/W1850315098","https://openalex.org/W2030356709","https://openalex.org/W2753431681","https://openalex.org/W3118424976","https://openalex.org/W2123032878","https://openalex.org/W1574362647","https://openalex.org/W1585372881","https://openalex.org/W3018553086"],"abstract_inverted_index":{"The":[0,203],"problem":[1],"of":[2,198,213,228,235,246,252,287],"identifying":[3],"a":[4,8,18,33,57,73,78,111,169,195,206,221,299],"planted":[5,24,61,74,112,230,267,275],"assignment":[6,16,75],"given":[7,32],"random":[9],"$k$-satisfiability":[10],"($k$-SAT)":[11],"formula":[12,34],"consistent":[13],"with":[14,35,82,110,298],"the":[15,23,46,91,96,199,211,226,247,285,292],"exhibits":[17],"large":[19],"algorithmic":[20,201],"gap:":[21],"while":[22],"solution":[25],"becomes":[26],"unique":[27],"and":[28,55,77,148,257,291],"can":[29,165],"be":[30,166],"identified":[31],"$O(n\\log":[36],"n)$":[37],"clauses,":[38],"there":[39],"are":[40],"distributions":[41,178],"over":[42,177],"clauses":[43,81],"for":[44,60,94,107,127,175,210,284],"which":[45,63,95],"best-known":[47],"efficient":[48],"algorithms":[49,130],"require":[50],"$n^{k/2}$":[51],"clauses.":[52],"We":[53,85,232],"propose":[54],"study":[56],"unified":[58],"model":[59],"$k$-SAT,":[62],"captures":[64],"well-known":[65],"special":[66],"cases.":[67],"An":[68],"instance":[69],"is":[70,98,117],"described":[71],"by":[72],"$\\sigma$":[76],"distribution":[79,88,97,109],"on":[80,250,261],"$k$":[83],"literals.":[84],"define":[86],"its":[87],"complexity":[89],"as":[90,162],"largest":[92],"$r$":[93],"not":[99],"$r$-wise":[100],"independent":[101],"($1":[102],"\\le":[103,105],"r":[104],"k$":[106],"any":[108],"assignment).":[113],"Our":[114,269],"main":[115],"result":[116],"an":[118],"unconditional":[119],"lower":[120,192,237,259],"bound,":[121],"tight":[122],"up":[123],"to":[124,220,239,258,273],"logarithmic":[125],"factors,":[126],"statistical":[128,170,180,214],"(query)":[129],"[M.":[131],"Kearns,":[132],"J.":[133,151],"ACM,":[134,152],"45":[135],"(1998),":[136],"pp.":[137,155,255],"983--1006;":[138],"V.":[139],"Feldman,":[140],"E.":[141],"Grigorescu,":[142],"L.":[143],"Reyzin,":[144],"S.":[145,146],"Vempala,":[147],"Y.":[149],"Xiao,":[150],"64":[153],"(2017),":[154],"8:1--8:37],":[156],"matching":[157],"known":[158,173],"upper":[159],"bounds,":[160],"which,":[161],"we":[163],"show,":[164],"implemented":[167],"using":[168],"algorithm.":[171],"Since":[172],"approaches":[174],"problems":[176],"have":[179],"analogues":[181],"(spectral,":[182],"Markov":[183],"Chain":[184],"Monte":[185],"Carlo,":[186],"gradient-based,":[187],"convex":[188,263],"optimization,":[189],"etc.),":[190],"this":[191],"bound":[193],"provides":[194],"rigorous":[196],"explanation":[197],"observed":[200],"gap.":[202],"proof":[204],"introduces":[205],"new":[207],"general":[208,262],"technique":[209],"analysis":[212],"query":[215],"algorithms.":[216],"It":[217],"also":[218,271],"points":[219],"geometric":[222],"paring":[223],"phenomenon":[224],"in":[225,279],"space":[227],"all":[229],"assignments.":[231],"describe":[233],"consequences":[234],"our":[236],"bounds":[238,260,270],"Feige's":[240],"refutation":[241],"hypothesis":[242],"[U.":[243],"Feige,":[244],"Proceedings":[245],"ACM":[248],"Symposium":[249],"Theory":[251],"Computing,":[253],"2002,":[254],"534--543]":[256],"programs":[264],"that":[265],"solve":[266],"$k$-SAT.":[268],"extend":[272],"other":[274],"$k$-CSP":[276],"models":[277],"and,":[278],"particular,":[280],"provide":[281],"concrete":[282],"evidence":[283],"security":[286],"Goldreich's":[288],"one-way":[289],"function":[290],"associated":[293],"pseudorandom":[294],"generator":[295],"when":[296],"used":[297],"sufficiently":[300],"hard":[301],"predicate":[302],"[O.":[303],"Goldreich,":[304],"preprint,":[305],"ia.cr/2000/063,":[306],"2000].":[307]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}