{"id":"https://openalex.org/W2987726486","doi":"https://doi.org/10.3390/a12110230","title":"The Inapproximability of k-DominatingSet for Parameterized AC 0 Circuits \u2020","display_name":"The Inapproximability of k-DominatingSet for Parameterized AC 0 Circuits \u2020","publication_year":2019,"publication_date":"2019-11-04","ids":{"openalex":"https://openalex.org/W2987726486","doi":"https://doi.org/10.3390/a12110230","mag":"2987726486"},"language":"en","primary_location":{"id":"doi:10.3390/a12110230","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12110230","pdf_url":"https://www.mdpi.com/1999-4893/12/11/230/pdf?version=1572860934","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/12/11/230/pdf?version=1572860934","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Wenxing Lai","orcid":"https://orcid.org/0000-0002-7525-692X"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenxing Lai","raw_affiliation_strings":["Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai 201203, China"],"raw_orcid":"https://orcid.org/0000-0002-7525-692X","affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai 201203, China","institution_ids":["https://openalex.org/I24943067"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I24943067"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.1928,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56545829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"11","first_page":"230","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7798586487770081},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7397680878639221},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.6793107986450195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.674497663974762},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6414153575897217},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6204367876052856},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.6196092963218689},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5434662103652954},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5071284770965576},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.22638684511184692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17438113689422607}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7798586487770081},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7397680878639221},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.6793107986450195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.674497663974762},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6414153575897217},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6204367876052856},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6196092963218689},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5434662103652954},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5071284770965576},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.22638684511184692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17438113689422607},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a12110230","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12110230","pdf_url":"https://www.mdpi.com/1999-4893/12/11/230/pdf?version=1572860934","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:c1e9b7c6b1324c38ae6c621b47d1149e","is_oa":true,"landing_page_url":"https://doaj.org/article/c1e9b7c6b1324c38ae6c621b47d1149e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 12, Iss 11, p 230 (2019)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/12/11/230/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a12110230","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a12110230","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12110230","pdf_url":"https://www.mdpi.com/1999-4893/12/11/230/pdf?version=1572860934","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1883207244","display_name":null,"funder_award_id":"61872092","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1549845494","https://openalex.org/W1988762827","https://openalex.org/W1989616165","https://openalex.org/W2003159902","https://openalex.org/W2012948111","https://openalex.org/W2013652529","https://openalex.org/W2026339776","https://openalex.org/W2036656440","https://openalex.org/W2040924621","https://openalex.org/W2044471216","https://openalex.org/W2044535619","https://openalex.org/W2052333181","https://openalex.org/W2059453880","https://openalex.org/W2060270693","https://openalex.org/W2066356146","https://openalex.org/W2083820240","https://openalex.org/W2094067618","https://openalex.org/W2126479983","https://openalex.org/W2127485201","https://openalex.org/W2143996311","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2165293955","https://openalex.org/W2401610261","https://openalex.org/W2404960361","https://openalex.org/W2775084241","https://openalex.org/W2796002431","https://openalex.org/W2809266875","https://openalex.org/W2886103250","https://openalex.org/W2928878508","https://openalex.org/W2938739939","https://openalex.org/W2949604493","https://openalex.org/W2963439929","https://openalex.org/W2963501551","https://openalex.org/W2963579754","https://openalex.org/W2963957639","https://openalex.org/W2964642894","https://openalex.org/W4292230561","https://openalex.org/W6661977751"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W4200634309","https://openalex.org/W346875545"],"abstract_inverted_index":{"Chen":[0],"and":[1,17,92,94,113],"Flum":[2],"showed":[3],"that":[4,62,99,117,142,165,199,209],"any":[5,85,134],"FPT-approximation":[6],"of":[7,43,152,168],"the":[8,18,37,44,71,100,140,143,200],"k-Clique":[9],"problem":[10,21,46,73,126,145],"is":[11,32,47],"not":[12,23,123],"in":[13,48,103],"para-":[14,27,49,118],"AC":[15,28,50,119],"0":[16,29,51,120,161],"k-DominatingSet":[19],"(k-DomSet)":[20],"could":[22,122],"be":[24,75,107,147,203],"computed":[25,148],"by":[26,81,89,149,207],"circuits.":[30],"It":[31],"natural":[33],"to":[34,205],"ask":[35],"whether":[36],"f":[38,76,88,129],"(":[39,77,130,172],"k":[40,78,131,173,194],")":[41,79,132,174],"-approximation":[42],"k-DomSet":[45,72],"for":[52,84,133,157],"some":[53,158],"computable":[54,86,135],"function":[55,87,136],"f.":[56,137],"Very":[57],"recently":[58],"it":[59,210],"was":[60],"proved":[61],"assuming":[63],"W":[64],"[":[65],"1":[66,192,215],"]":[67],"\u2260":[68],"FPT":[69,82],",":[70,162],"cannot":[74,146,175],"-approximated":[80],"algorithms":[83],"S.,":[90],"Laekhanukit":[91],"Manurangsi":[93],"Lin,":[95],"seperately.":[96],"We":[97],"observe":[98],"constructions":[101],"used":[102],"Lin\u2019s":[104],"work":[105],"can":[106],"carried":[108],"out":[109],"using":[110],"constant-depth":[111,150,166],"circuits,":[112],"thus":[114],"we":[115,163,197],"prove":[116],"circuits":[121,151,167],"approximate":[124],"this":[125],"with":[127],"ratio":[128],"Moreover,":[138],"under":[139],"hypothesis":[141,201],"3-CNF-SAT":[144],"size":[153,169],"2":[154],"\u03b5":[155,159],"n":[156,170,187,191],">":[160,185],"show":[164],"o":[171],"distinguish":[176],"graphs":[177],"whose":[178],"dominating":[179],"numbers":[180],"are":[181],"either":[182],"\u2264k":[183],"or":[184],"log":[186,189,190],"3":[188],"/":[193],".":[195,216],"However,":[196],"find":[198],"may":[202],"hard":[204],"settle":[206],"showing":[208],"implies":[211],"NP":[212],"\u2288":[213],"NC":[214]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}