{"id":"https://openalex.org/W1968259829","doi":"https://doi.org/10.1137/0206009","title":"Evaluating Relational Expressions with Dense and Sparse Arguments","display_name":"Evaluating Relational Expressions with Dense and Sparse Arguments","publication_year":1977,"publication_date":"1977-03-01","ids":{"openalex":"https://openalex.org/W1968259829","doi":"https://doi.org/10.1137/0206009","mag":"1968259829"},"language":"en","primary_location":{"id":"doi:10.1137/0206009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206009","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5028962222","display_name":"Thomas G. Szymanski","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"T. G. Szymanski","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089065417","display_name":"Jeffrey D. Ullman","orcid":"https://orcid.org/0000-0002-1847-3426"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. D. Ullman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028962222"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6138,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.59351806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"1","first_page":"109","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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.9538000226020813,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9458000063896179,"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/transitive-closure","display_name":"Transitive closure","score":0.9150201082229614},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.7264646291732788},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6129245758056641},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5873135924339294},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.584629476070404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5432840585708618},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.5100739598274231},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.5010645389556885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4621821641921997},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4478661119937897},{"id":"https://openalex.org/keywords/operand","display_name":"Operand","score":0.4356616735458374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3650582730770111},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3601608872413635},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.15283533930778503},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1495133936405182},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11532780528068542},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08621826767921448}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9150201082229614},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.7264646291732788},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6129245758056641},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5873135924339294},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.584629476070404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5432840585708618},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.5100739598274231},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.5010645389556885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4621821641921997},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4478661119937897},{"id":"https://openalex.org/C55526617","wikidata":"https://www.wikidata.org/wiki/Q719375","display_name":"Operand","level":2,"score":0.4356616735458374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3650582730770111},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3601608872413635},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.15283533930778503},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1495133936405182},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11532780528068542},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08621826767921448},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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.1137/0206009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206009","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2002055996","https://openalex.org/W2067924727","https://openalex.org/W2140232587"],"related_works":["https://openalex.org/W2764268078","https://openalex.org/W2021661549","https://openalex.org/W2171308818","https://openalex.org/W2009489912","https://openalex.org/W1565068544","https://openalex.org/W4297054060","https://openalex.org/W2963936427","https://openalex.org/W2028563407","https://openalex.org/W1968259829","https://openalex.org/W2085546716"],"abstract_inverted_index":{"We":[0,22],"consider":[1],"expressions":[2],"whose":[3,8],"arguments":[4],"are":[5,10],"relations":[6],"and":[7,18],"operators":[9],"chosen":[11],"from":[12],"among":[13],"$\\cup":[14],",":[15],"\\circ":[16],",{}^*$,":[17],"${}^{":[19],"-":[20],"1}$.":[21],"further":[23],"assume":[24],"that":[25],"operands":[26],"may":[27],"be":[28,37],"designated":[29],"\u201csparse\u201d":[30],"or":[31],"\u201cdense\u201d,":[32],"in":[33],"a":[34],"manner":[35],"to":[36,44],"made":[38],"formal":[39],"subsequently.":[40],"Our":[41],"aim":[42],"is":[43,53],"determine":[45],"whether":[46],"the":[47],"evaluation":[48],"of":[49,77],"such":[50],"an":[51,78],"expression":[52],"(a)":[54],"as":[55,57,62,64,71,73],"hard":[56,63,72],"general":[58],"transitive":[59,65],"closure,":[60],"(b)":[61],"closure":[66],"for":[67],"sparse":[68],"graphs,":[69],"(c)":[70],"finding":[74],"connected":[75],"components":[76],"undirected":[79],"graph.":[80]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}