{"id":"https://openalex.org/W2158154629","doi":"https://doi.org/10.1002/malq.19970430204","title":"Computation Models for Parameterized Complexity","display_name":"Computation Models for Parameterized Complexity","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2158154629","doi":"https://doi.org/10.1002/malq.19970430204","mag":"2158154629"},"language":"en","primary_location":{"id":"doi:10.1002/malq.19970430204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19970430204","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0044-3050","issn":["0044-3050","0942-5616","1521-3870"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Logic Quarterly","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2108/260205","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061589069","display_name":"Marco Cesati","orcid":"https://orcid.org/0000-0002-7492-3129"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Cesati","raw_affiliation_strings":["Department of Computer Science, University of Rome \u201cLa Sapienza\u201d, via Salaria 113, 00198 Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Rome \u201cLa Sapienza\u201d, via Salaria 113, 00198 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063705292","display_name":"Miriam Dilanni","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Miriam Dilanni","raw_affiliation_strings":["Department of Computer Science, University of Rome \u201cLa Sapienza\u201d, via Salaria 113, 00198 Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Rome \u201cLa Sapienza\u201d, via Salaria 113, 00198 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063705292"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":2630,"currency":"USD","value_usd":2630},"apc_paid":null,"fwci":0.5113,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.68943469,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"43","issue":"2","first_page":"179","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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/T11567","display_name":"semigroups and automata theory","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.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9955999851226807,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9722863435745239},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.6731289029121399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.646641731262207},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6239371299743652},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6226211190223694},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5915886759757996},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5806077122688293},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5362244248390198},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5237962007522583},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5021548271179199},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4976241886615753},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48654451966285706},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.47432512044906616},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4699663817882538},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.44151073694229126},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4329957365989685},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3903312683105469},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.34530898928642273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2709507644176483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2304859757423401},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.15777993202209473},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.08119180798530579}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9722863435745239},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.6731289029121399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.646641731262207},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6239371299743652},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6226211190223694},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5915886759757996},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5806077122688293},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5362244248390198},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5237962007522583},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5021548271179199},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4976241886615753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48654451966285706},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.47432512044906616},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4699663817882538},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.44151073694229126},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4329957365989685},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3903312683105469},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.34530898928642273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2709507644176483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2304859757423401},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.15777993202209473},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.08119180798530579},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/malq.19970430204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19970430204","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0044-3050","issn":["0044-3050","0942-5616","1521-3870"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Logic Quarterly","raw_type":"journal-article"},{"id":"pmh:oai:art.torvergata.it:2108/260205","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/260205","pdf_url":"http://hdl.handle.net/2108/260205","source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:art.torvergata.it:2108/260205","is_oa":true,"landing_page_url":"http://hdl.handle.net/2108/260205","pdf_url":"http://hdl.handle.net/2108/260205","source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2158154629.pdf","grobid_xml":"https://content.openalex.org/works/W2158154629.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W66071877","https://openalex.org/W636367345","https://openalex.org/W1918504188","https://openalex.org/W1982384331","https://openalex.org/W2002089154","https://openalex.org/W2011039300","https://openalex.org/W2017315323","https://openalex.org/W2022841964","https://openalex.org/W2061513598","https://openalex.org/W2312502266","https://openalex.org/W6602694808"],"related_works":["https://openalex.org/W1999609654","https://openalex.org/W2911798073","https://openalex.org/W2122747219","https://openalex.org/W2075449032","https://openalex.org/W1556737090","https://openalex.org/W1520700928","https://openalex.org/W1981385397","https://openalex.org/W2053392269","https://openalex.org/W1504200807","https://openalex.org/W2158154629"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"parameterized":[2,65,84,114,121,159,188],"computational":[3,174],"problem":[4,108],"is":[5,17,24,52,161],"a":[6,18,45,53,72,162],"set":[7],"of":[8,27,35,47,74,105,131,141,168,172,183,186],"pairs":[9],"(":[10],"x":[11],",":[12,37],"k":[13,16,36],"),":[14],"where":[15,50],"distinguished":[19],"item":[20],"called":[21],"\u201cparameter\u201d.":[22],"FPT":[23],"the":[25,58,106,129,139,142,166,169,179,187],"class":[26],"fixed\u2010parameter":[28],"tractable":[29],"problems:":[30],"for":[31,109,165],"any":[32],"fixed":[33],"value":[34],"they":[38,87],"are":[39],"solvable":[40],"in":[41,150],"time":[42],"bounded":[43],"by":[44],"polynomial":[46],"degree":[48],"\u03b1,":[49],"\u03b1":[51],"constant":[54],"not":[55],"dependent":[56],"on":[57,125,138],"parameter.":[59],"In":[60,98],"order":[61],"to":[62],"deal":[63],"with":[64,113],"intractability,":[66],"Downey":[67],"and":[68,86,116,134,137,176],"Fellows":[69],"have":[70,88,93],"introduced":[71],"hierarchy":[73],"classes":[75,92],"W[l]":[76],"\u2286":[77,79],"W[2]":[78],"\u20db":[80],"containing":[81],"likely":[82],"intractable":[83],"problems,":[85],"shown":[89],"that":[90,119,145,158],"such":[91,152],"many":[94],"natural,":[95],"complete":[96],"languages.":[97],"this":[99],"paper":[100],"we":[101,117,156,177],"analyze":[102],"several":[103],"variations":[104],"halting":[107],"nondeterministic":[110],"Turing":[111],"machines":[112],"time,":[115],"show":[118,157],"its":[120],"complexity":[122,148,160],"strongly":[123],"depends":[124],"some":[126,173,184],"resources":[127],"like":[128],"number":[130],"tapes,":[132],"head":[133],"internal":[135],"states,":[136],"size":[140],"alphabet.":[143],"Notice":[144],"classical":[146],"polynomial\u2010time":[147],"fails":[149],"distinguishing":[151],"features.":[153],"As":[154],"byproducts,":[155],"useful":[163],"tool":[164],"study":[167],"intrinsic":[170],"power":[171],"models,":[175],"underline":[178],"different":[180],"\u201ccomputational":[181],"powers\u201d":[182],"levels":[185],"hierarchy.":[189]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2016-06-24T00:00:00"}