{"id":"https://openalex.org/W1573382591","doi":"https://doi.org/10.1007/3-540-51498-8_31","title":"Extensional properties of sets of time bounded complexity (extended abstract)","display_name":"Extensional properties of sets of time bounded complexity (extended abstract)","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W1573382591","doi":"https://doi.org/10.1007/3-540-51498-8_31","mag":"1573382591"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-51498-8_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-51498-8_31","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/A5043339871","display_name":"Wolfgang Maass","orcid":"https://orcid.org/0000-0002-1178-087X"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wolfgang Maass","raw_affiliation_strings":["Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 60680, Chicago, IL","University of Illinois at Chicago"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 60680, Chicago, IL","institution_ids":["https://openalex.org/I39422238"]},{"raw_affiliation_string":"University of Illinois at Chicago","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056375116","display_name":"Theodore A. Slaman","orcid":"https://orcid.org/0000-0002-1719-2630"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Theodore A. Slaman","raw_affiliation_strings":["Department of Mathematics, University of Chicago, 60637, Chicago, IL","University-of Chicago"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Chicago, 60637, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"University-of Chicago","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043339871"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4323,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.87214286,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"318","last_page":"326"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11567","display_name":"semigroups and automata theory","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/T10720","display_name":"Complexity and Algorithms in Graphs","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"}}],"keywords":[{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6558629274368286},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.6487491130828857},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.638606607913971},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5819426774978638},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.527447521686554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5120923519134521},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4460175037384033},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.440085232257843},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4223834276199341},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3742607831954956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3742297291755676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30980968475341797},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.29013004899024963}],"concepts":[{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6558629274368286},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.6487491130828857},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.638606607913971},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5819426774978638},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.527447521686554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5120923519134521},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4460175037384033},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.440085232257843},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4223834276199341},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3742607831954956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3742297291755676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30980968475341797},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.29013004899024963},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-51498-8_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-51498-8_31","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":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W245191144","https://openalex.org/W1579083493","https://openalex.org/W1655990431","https://openalex.org/W1972026679","https://openalex.org/W1996028864","https://openalex.org/W2012030760","https://openalex.org/W2020242021","https://openalex.org/W2023336906","https://openalex.org/W2056414301","https://openalex.org/W2089442854","https://openalex.org/W2125573351","https://openalex.org/W2167636857","https://openalex.org/W2188516234","https://openalex.org/W4232277851"],"related_works":["https://openalex.org/W4324296894","https://openalex.org/W2173966285","https://openalex.org/W1702487489","https://openalex.org/W2086025566","https://openalex.org/W113209803","https://openalex.org/W2144557478","https://openalex.org/W1483438220","https://openalex.org/W1722394934","https://openalex.org/W2075449032","https://openalex.org/W2415632638"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}