{"id":"https://openalex.org/W1986602165","doi":"https://doi.org/10.1016/0304-3975(83)90020-8","title":"Some consequences of non-uniform conditions on uniform classes","display_name":"Some consequences of non-uniform conditions on uniform classes","publication_year":1983,"publication_date":"1983-10-01","ids":{"openalex":"https://openalex.org/W1986602165","doi":"https://doi.org/10.1016/0304-3975(83)90020-8","mag":"1986602165"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(83)90020-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(83)90020-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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/A5078989577","display_name":"Chee Yap","orcid":"https://orcid.org/0000-0003-2952-3545"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chee K. Yap","raw_affiliation_strings":["Department of Computer Science, University of Southern California, University Park, Los Angeles, CA 90007, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Southern California, University Park, Los Angeles, CA 90007, U.S.A","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078989577"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":3.9978,"has_fulltext":false,"cited_by_count":243,"citation_normalized_percentile":{"value":0.94040279,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"26","issue":"3","first_page":"287","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9965000152587891,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9965000152587891,"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.9916999936103821,"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.9907000064849854,"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/generalization","display_name":"Generalization","score":0.8351485729217529},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.74198317527771},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6570331454277039},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6359833478927612},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6192507147789001},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5098847150802612},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4825986623764038},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44097113609313965},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.4296649396419525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27123528718948364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21032026410102844}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.8351485729217529},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.74198317527771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6570331454277039},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6359833478927612},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6192507147789001},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5098847150802612},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4825986623764038},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44097113609313965},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.4296649396419525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27123528718948364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21032026410102844},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(83)90020-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(83)90020-8","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"}],"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/W149859832","https://openalex.org/W1519919954","https://openalex.org/W1970089350","https://openalex.org/W1986203294","https://openalex.org/W1986448430","https://openalex.org/W1997491141","https://openalex.org/W2013455832","https://openalex.org/W2027466944","https://openalex.org/W2038705764","https://openalex.org/W2042940615","https://openalex.org/W2055734996","https://openalex.org/W2065251436","https://openalex.org/W2090186532","https://openalex.org/W2142111986","https://openalex.org/W6606001172","https://openalex.org/W6642755269","https://openalex.org/W6646631772","https://openalex.org/W6646903115","https://openalex.org/W7025394483"],"related_works":["https://openalex.org/W4388962799","https://openalex.org/W2041517264","https://openalex.org/W1522180487","https://openalex.org/W4294789866","https://openalex.org/W1969386550","https://openalex.org/W2982557863","https://openalex.org/W2590361123","https://openalex.org/W1575303034","https://openalex.org/W2171811389","https://openalex.org/W1589381382"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":18}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}