{"id":"https://openalex.org/W1525631812","doi":"https://doi.org/10.1007/11779148_33","title":"Finding Lower Bounds for Nondeterministic State Complexity Is Hard","display_name":"Finding Lower Bounds for Nondeterministic State Complexity Is Hard","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1525631812","doi":"https://doi.org/10.1007/11779148_33","mag":"1525631812"},"language":"en","primary_location":{"id":"doi:10.1007/11779148_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11779148_33","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":"article","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/A5040523230","display_name":"Hermann Gruber","orcid":"https://orcid.org/0000-0002-1953-3697"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hermann Gruber","raw_affiliation_strings":["Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching bei M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching bei M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016664760","display_name":"Markus Holzer","orcid":"https://orcid.org/0000-0003-4224-4014"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Holzer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching bei M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching bei M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040523230"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8368,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70870266,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":null,"first_page":"363","last_page":"374"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9944999814033508,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7973471879959106},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.61152583360672},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.600114643573761},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5309593081474304},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.5022881031036377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4705909490585327},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4569667875766754},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4540577232837677},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4482342600822449},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.364875465631485},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35828882455825806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3035418391227722},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2693828344345093},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.18483245372772217}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7973471879959106},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.61152583360672},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.600114643573761},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5309593081474304},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.5022881031036377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4705909490585327},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4569667875766754},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4540577232837677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4482342600822449},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.364875465631485},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35828882455825806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3035418391227722},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2693828344345093},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.18483245372772217},{"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/11779148_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11779148_33","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":"mag:1525631812","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc13.html#GruberH06","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W42926958","https://openalex.org/W126184746","https://openalex.org/W143525561","https://openalex.org/W1493925387","https://openalex.org/W1527071401","https://openalex.org/W1545682790","https://openalex.org/W1551875948","https://openalex.org/W1606484542","https://openalex.org/W1817451992","https://openalex.org/W1995341919","https://openalex.org/W2008342226","https://openalex.org/W2025521996","https://openalex.org/W2038455086","https://openalex.org/W2040834199","https://openalex.org/W2054230520","https://openalex.org/W2054801208","https://openalex.org/W2061668791","https://openalex.org/W2077170493","https://openalex.org/W2080108335","https://openalex.org/W2142151475","https://openalex.org/W2149288970","https://openalex.org/W3134257814","https://openalex.org/W4210377846"],"related_works":["https://openalex.org/W1545682790","https://openalex.org/W1566279036","https://openalex.org/W147059047","https://openalex.org/W2031137635","https://openalex.org/W2090698092","https://openalex.org/W1987681136","https://openalex.org/W2465024128","https://openalex.org/W2142482847","https://openalex.org/W1485439933","https://openalex.org/W1932250828","https://openalex.org/W275231650","https://openalex.org/W2115334306","https://openalex.org/W1699753700","https://openalex.org/W1620689985","https://openalex.org/W36294487","https://openalex.org/W2034870758","https://openalex.org/W3018694765","https://openalex.org/W2136083928","https://openalex.org/W21453999","https://openalex.org/W1807114442"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}