{"id":"https://openalex.org/W1606810574","doi":"https://doi.org/10.1007/978-3-540-27836-8_48","title":"Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits","display_name":"Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1606810574","doi":"https://doi.org/10.1007/978-3-540-27836-8_48","mag":"1606810574"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27836-8_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27836-8_48","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/A5113696666","display_name":"J\u00f6rg Flum","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J\u00f6rg Flum","raw_affiliation_strings":["Abteilung f\u00fcr Mathematische Logik, Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Abteilung f\u00fcr Mathematische Logik, Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085789601","display_name":"Mark Weyer","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mark Weyer","raw_affiliation_strings":["Abteilung f\u00fcr Mathematische Logik, Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Abteilung f\u00fcr Mathematische Logik, Albert-Ludwigs-Universit\u00e4t, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113696666"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4777,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89816166,"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":"555","last_page":"567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9962000250816345,"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.9962000250816345,"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.9950000047683716,"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/T10142","display_name":"Formal Methods in Verification","score":0.9943000078201294,"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.879427433013916},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.865827202796936},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8154465556144714},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6177986264228821},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6014614105224609},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5724539160728455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5720406770706177},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5261287689208984},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4561547338962555},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.43736395239830017},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41210633516311646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31871330738067627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31786322593688965},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.23228704929351807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17424899339675903},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.07648947834968567},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0642709732055664}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.879427433013916},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.865827202796936},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8154465556144714},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6177986264228821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6014614105224609},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5724539160728455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5720406770706177},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5261287689208984},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4561547338962555},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.43736395239830017},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41210633516311646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31871330738067627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31786322593688965},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.23228704929351807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17424899339675903},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.07648947834968567},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0642709732055664},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-27836-8_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27836-8_48","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.8996","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.8996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.hu-berlin.de/~grohe/pub/flugrowey06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W182506548","https://openalex.org/W1579643516","https://openalex.org/W1606810574","https://openalex.org/W2005485907","https://openalex.org/W2018964411","https://openalex.org/W2021131202","https://openalex.org/W2025038593","https://openalex.org/W2031661891","https://openalex.org/W2101407539","https://openalex.org/W2119290765","https://openalex.org/W2132750992","https://openalex.org/W2137931097","https://openalex.org/W2150460548","https://openalex.org/W2177603603","https://openalex.org/W2401216365","https://openalex.org/W2579801771","https://openalex.org/W2913688336","https://openalex.org/W4252272319","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2105859078","https://openalex.org/W2033042995","https://openalex.org/W2041317738","https://openalex.org/W2000805093","https://openalex.org/W2158154629","https://openalex.org/W1676587966","https://openalex.org/W1638461282","https://openalex.org/W2021218132","https://openalex.org/W2415632638","https://openalex.org/W2148761449"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}