{"id":"https://openalex.org/W7170142342","doi":"https://doi.org/10.4230/lipics.ccc.2026.1","title":"Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding Under ETH","display_name":"Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding Under ETH","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170142342","doi":"https://doi.org/10.4230/lipics.ccc.2026.1"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.1","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.1","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135931426","display_name":"Rishav Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Gupta, Rishav","raw_affiliation_strings":["National University of Singapore, Singapore"],"raw_orcid":"https://orcid.org/0009-0002-4424-5432","affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101847362","display_name":"Bingkai Lin","orcid":"https://orcid.org/0000-0002-3444-6380"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin, Bingkai","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"raw_orcid":"https://orcid.org/0000-0002-3444-6380","affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5124048965","display_name":"X B Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zheng, Xin","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"raw_orcid":"https://orcid.org/0009-0000-0227-2833","affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8199999928474426},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6444000005722046},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6330999732017517},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6191999912261963},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5976999998092651},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5733000040054321},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5450999736785889},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.48170000314712524},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.44760000705718994}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8199999928474426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7893999814987183},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6445000171661377},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6444000005722046},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6330999732017517},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6191999912261963},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5976999998092651},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5733000040054321},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5450999736785889},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4925999939441681},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.48170000314712524},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.44760000705718994},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44279998540878296},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.44110000133514404},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4223000109195709},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.365200012922287},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C55974624","wikidata":"https://www.wikidata.org/wiki/Q1188504","display_name":"Exponential family","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.25609999895095825},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.1","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.1","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.1","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.1","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,57,81],"present":[1],"a":[2,59,71,78,84,93,121,161],"simple":[3],"deterministic":[4],"reduction":[5,159],"which,":[6],"assuming":[7],"the":[8,19,27,42,88,109,129,153,170],"Exponential":[9,112],"Time":[10,113],"Hypothesis":[11,114],"(ETH),":[12],"yields":[13],"tight":[14],"lower":[15,132,172],"bounds":[16],"for":[17,102],"approximating":[18,156],"parameterized":[20,28],"Maximum":[21],"Likelihood":[22],"Decoding":[23],"problem":[24],"(MLD)":[25],"and":[26,92,164],"Nearest":[29],"Codeword":[30],"Problem":[31],"(NCP)":[32],"within":[33],"some":[34],"fixed":[35],"constant":[36],"factor.":[37],"Our":[38],"starting":[39],"point":[40],"is":[41,120],"ETH-based":[43],"exponential-time":[44],"hardness":[45,101,154],"of":[46,67,87,155],"(c,":[47,60],"s)-Gap":[48,61],"MAXLIN":[49,62],"established":[50],"in":[51],"[Nir":[52],"Bitansky":[53],"et":[54,142],"al.,":[55,143],"2024].":[56],"transform":[58],"instance":[63,66],"into":[64],"an":[65],"\u03b3-Gap":[68],"k-MLD":[69],"via":[70],"novel":[72],"combinatorial":[73],"object":[74],"that":[75,148],"we":[76],"call":[77],"cover":[79,90],"family.":[80],"provide":[82],"both":[83],"randomized":[85,110],"construction":[86],"required":[89],"families":[91],"subsequent":[94],"derandomization.":[95],"Prior":[96],"to":[97,139,168],"our":[98,158],"work,":[99],"n^{\u03a9(k)}":[100],"constant-factor":[103],"approximation":[104],"was":[105,134],"only":[106],"shown":[107],"under":[108],"Gap":[111],"Gap-ETH":[115],"[Pasin":[116],"Manurangsi,":[117],"2020],":[118],"which":[119],"much":[122],"stronger":[123],"assumption":[124],"than":[125],"ETH.":[126],"Under":[127],"ETH,":[128],"strongest":[130],"known":[131],"bound":[133],"n^{\u03a9(k/poly":[135],"log":[136],"k)}":[137],"due":[138],"[Mitali":[140],"Bafna":[141],"2025].":[144],"Unlike":[145],"previous":[146],"approaches":[147],"rely":[149],"on":[150],"reductions":[151],"from":[152],"2-CSP,":[157],"provides":[160],"more":[162],"direct":[163],"conceptually":[165],"simpler":[166],"route":[167],"achieving":[169],"optimal":[171],"bounds.":[173]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}