{"id":"https://openalex.org/W4255801061","doi":"https://doi.org/10.1109/ccc.2004.1313826","title":"Tight lower bounds for certain parameterized NP-hard problems","display_name":"Tight lower bounds for certain parameterized NP-hard problems","publication_year":2004,"publication_date":"2004-11-13","ids":{"openalex":"https://openalex.org/W4255801061","doi":"https://doi.org/10.1109/ccc.2004.1313826"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2004.1313826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Department of Computer Science, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059847817","display_name":"Benny Chor","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"B. Chor","raw_affiliation_strings":["School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"M. Fellows","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021456840","display_name":"Xiuzhen Huang","orcid":"https://orcid.org/0000-0003-0498-3131"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiuzhen Huang","raw_affiliation_strings":["Department of Computer Science, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041371629","display_name":"D. Juedes","orcid":null},"institutions":[{"id":"https://openalex.org/I4210106879","display_name":"Ohio University","ror":"https://ror.org/01jr3y717","country_code":"US","type":"education","lineage":["https://openalex.org/I4210106879"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Juedes","raw_affiliation_strings":["School of EE&CS, Ohio University, Athens, OH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of EE&CS, Ohio University, Athens, OH, USA","institution_ids":["https://openalex.org/I4210106879"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I. Kanj","raw_affiliation_strings":["School of CTI, De Paul University, Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of CTI, De Paul University, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112078381","display_name":"Ge Xia","orcid":"https://orcid.org/0000-0001-7536-0826"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ge Xia","raw_affiliation_strings":["Department of Computer Science, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":null,"first_page":"150","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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.9860000014305115,"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.9509494304656982},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7080625295639038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6210755109786987},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6162603497505188},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5692852139472961},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5595464706420898},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5429290533065796},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5189006924629211},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4824257791042328},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4753025472164154},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46133530139923096},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.41597509384155273},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4072793126106262},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.272336483001709},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20404866337776184}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9509494304656982},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7080625295639038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6210755109786987},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6162603497505188},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5692852139472961},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5595464706420898},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5429290533065796},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5189006924629211},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4824257791042328},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4753025472164154},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46133530139923096},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.41597509384155273},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4072793126106262},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.272336483001709},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20404866337776184},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccc.2004.1313826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1519147138","https://openalex.org/W1528489445","https://openalex.org/W1562906735","https://openalex.org/W1580213736","https://openalex.org/W1593916827","https://openalex.org/W1979740015","https://openalex.org/W1995725694","https://openalex.org/W2007979101","https://openalex.org/W2013415302","https://openalex.org/W2018964411","https://openalex.org/W2026771935","https://openalex.org/W2027999353","https://openalex.org/W2028904582","https://openalex.org/W2038225707","https://openalex.org/W2040761679","https://openalex.org/W2043177640","https://openalex.org/W2055738030","https://openalex.org/W2177603603","https://openalex.org/W4249409086","https://openalex.org/W4292230561","https://openalex.org/W6634719314","https://openalex.org/W6635454507"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W2767174160","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W4286853492","https://openalex.org/W3215145351","https://openalex.org/W2152809035","https://openalex.org/W2953291322","https://openalex.org/W4296116869"],"abstract_inverted_index":{"Based":[0],"on":[1,13,38],"the":[2,14,33,51,57,63,66,74,114,117,122,132,136,141,182],"framework":[3],"of":[4,20,73,88,116,140,152,205],"parameterized":[5,34,89,153,200],"complexity":[6,16],"theory,":[7],"we":[8,83],"derive":[9],"tight":[10],"lower":[11],"bounds":[12],"computational":[15],"for":[17],"a":[18,28,86],"number":[19],"well-known":[21],"NP-hard":[22,90],"problems.":[23],"We":[24,146],"start":[25],"by":[26,187],"proving":[27],"general":[29],"result,":[30],"namely":[31],"that":[32,85,149,197],"weighted":[35,93,157],"satisfiability":[36],"problem":[37],"depth-t":[39],"circuits":[40],"cannot":[41,104,170],"be":[42,105,127,171],"solved":[43,106,172],"in":[44,107,173,181,193],"time":[45,108,174,207],"n/sup":[46,109,175,209],"o(k)/poly(m),":[47,110],"where":[48,111],"n":[49,112],"is":[50,56,62,113,131],"circuit":[52,58],"input":[53],"length,":[54],"m":[55,130],"size,":[59,134],"and":[60,101,129,167,189],"k":[61,123],"parameter,":[64],"unless":[65,135,177],"(t":[67],"-":[68],"l)-st":[69],"level":[70,138],"W[t":[71],"$1]":[72],"W-hierarchy":[75,142],"collapses":[76,143],"to":[77,126,144],"FPT.":[78,145],"By":[79],"refining":[80],"this":[81],"technique,":[82],"prove":[84,148],"group":[87,151],"problems,":[91],"including":[92],"SAT,":[94],"dominating":[95],"set,":[96,98,103,169],"hitting":[97],"set":[99,119],"cover,":[100],"feature":[102],"size":[115],"universal":[118],"from":[120],"which":[121,155],"elements":[124],"are":[125,191],"selected":[128],"instance":[133],"first":[137],"W[l]":[139],"also":[147],"another":[150],"problems":[154,180,201],"includes":[156],"q-SAT":[158],"(for":[159],"any":[160],"fixed":[161],"q":[162],"/spl":[163],"ges/":[164],"2),":[165],"clique,":[166],"independent":[168],"o(k)/":[176],"all":[178,198],"search":[179],"syntactic":[183],"class":[184],"SNP,":[185],"introduced":[186],"Papadimitriou":[188],"Yannakakis,":[190],"solvable":[192],"subexponential":[194],"time.":[195],"Note":[196],"these":[199],"have":[202],"trivial":[203],"algorithms":[204],"running":[206],"either":[208],"k/":[210],"poly(m)":[211],"or":[212],"O(n/sup":[213],"k/).":[214]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}