{"id":"https://openalex.org/W150847977","doi":"https://doi.org/10.1007/978-3-662-46078-8_18","title":"Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP","display_name":"Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W150847977","doi":"https://doi.org/10.1007/978-3-662-46078-8_18","mag":"150847977"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-46078-8_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-46078-8_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5068702258","display_name":"Ronald de Haan","orcid":"https://orcid.org/0000-0003-2023-0586"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Ronald de Haan","raw_affiliation_strings":["Institute of Information Systems, Vienna University of Technology, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems, Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["Institute of Information Systems, Vienna University of Technology, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems, Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068702258"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3882,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78289765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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/T11567","display_name":"semigroups and automata theory","score":0.9980999827384949,"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.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9227726459503174},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.7400452494621277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6940840482711792},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6259303689002991},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5893293619155884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5183142423629761},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5169957876205444},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5132684707641602},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.4978358745574951},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.49473997950553894},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48431316018104553},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.46779996156692505},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.46691086888313293},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.4365483820438385},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4156127870082855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3127378225326538},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14489081501960754},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.1415627896785736},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.12595528364181519}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9227726459503174},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.7400452494621277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6940840482711792},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6259303689002991},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5893293619155884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5183142423629761},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5169957876205444},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5132684707641602},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.4978358745574951},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.49473997950553894},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48431316018104553},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.46779996156692505},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.46691086888313293},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4365483820438385},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4156127870082855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3127378225326538},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14489081501960754},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.1415627896785736},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.12595528364181519},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-46078-8_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-46078-8_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W155900513","https://openalex.org/W195515244","https://openalex.org/W987035227","https://openalex.org/W1517036688","https://openalex.org/W1527197079","https://openalex.org/W1532594152","https://openalex.org/W1549449731","https://openalex.org/W1570425181","https://openalex.org/W1586677474","https://openalex.org/W1587191403","https://openalex.org/W1788645111","https://openalex.org/W1817412228","https://openalex.org/W1988772559","https://openalex.org/W1996184580","https://openalex.org/W1999396796","https://openalex.org/W2002089154","https://openalex.org/W2007464118","https://openalex.org/W2012170877","https://openalex.org/W2031470081","https://openalex.org/W2065251436","https://openalex.org/W2074373676","https://openalex.org/W2116087731","https://openalex.org/W2171811389","https://openalex.org/W2402235836","https://openalex.org/W2480832319","https://openalex.org/W2481137663","https://openalex.org/W2913688336","https://openalex.org/W2953129498","https://openalex.org/W2963038528","https://openalex.org/W4253103663","https://openalex.org/W4292230561","https://openalex.org/W4298227433","https://openalex.org/W6634978047"],"related_works":["https://openalex.org/W4236887310","https://openalex.org/W1999609654","https://openalex.org/W2798907744","https://openalex.org/W2075449032","https://openalex.org/W2911798073","https://openalex.org/W1520700928","https://openalex.org/W4236121173","https://openalex.org/W2951313060","https://openalex.org/W1504200807","https://openalex.org/W150847977"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}