{"id":"https://openalex.org/W2018791466","doi":"https://doi.org/10.1016/0020-0190(88)90057-9","title":"On a complexity hierarchy between L and NL","display_name":"On a complexity hierarchy between L and NL","publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W2018791466","doi":"https://doi.org/10.1016/0020-0190(88)90057-9","mag":"2018791466"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(88)90057-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90057-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"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/A5072785502","display_name":"Sang Cho","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sang Cho","raw_affiliation_strings":["Computer Science Program, University of Texas at Dallas, Richardson, TX 75083, USA","Univ. of Texas at Dallas, Richardson"],"affiliations":[{"raw_affiliation_string":"Computer Science Program, University of Texas at Dallas, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Univ. of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109048685","display_name":"Dung T. Huynh","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dung T. Huynh","raw_affiliation_strings":["Computer Science Program, University of Texas at Dallas, Richardson, TX 75083, USA","Univ. of Texas at Dallas, Richardson"],"affiliations":[{"raw_affiliation_string":"Computer Science Program, University of Texas at Dallas, Richardson, TX 75083, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Univ. of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072785502"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.5301,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.6236411,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"4","first_page":"177","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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.9991999864578247,"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.998199999332428,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9886000156402588,"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/unary-operation","display_name":"Unary operation","score":0.8171752691268921},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7979515790939331},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.7662616968154907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7053309082984924},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6624011993408203},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6157200932502747},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5525515079498291},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5511191487312317},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5410656929016113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5298022627830505},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5117166042327881},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48939958214759827},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4419044256210327},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.4285238981246948},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4154907166957855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20257872343063354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1645798683166504}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8171752691268921},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7979515790939331},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7662616968154907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7053309082984924},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6624011993408203},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6157200932502747},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5525515079498291},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5511191487312317},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5410656929016113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5298022627830505},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5117166042327881},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48939958214759827},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4419044256210327},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.4285238981246948},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4154907166957855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20257872343063354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1645798683166504},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(88)90057-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(88)90057-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1516002824","https://openalex.org/W1982129592","https://openalex.org/W2017205387","https://openalex.org/W2065579926","https://openalex.org/W2090004024","https://openalex.org/W2188913344","https://openalex.org/W6630719580"],"related_works":["https://openalex.org/W2555642749","https://openalex.org/W1945859206","https://openalex.org/W2024994589","https://openalex.org/W2125536734","https://openalex.org/W1499975475","https://openalex.org/W70814323","https://openalex.org/W1629505938","https://openalex.org/W2074125075","https://openalex.org/W1982406523","https://openalex.org/W2000805093"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}