{"id":"https://openalex.org/W2002057456","doi":"https://doi.org/10.1137/0222042","title":"The Complexity of Processing Hierarchical Specifications","display_name":"The Complexity of Processing Hierarchical Specifications","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W2002057456","doi":"https://doi.org/10.1137/0222042","mag":"2002057456"},"language":"en","primary_location":{"id":"doi:10.1137/0222042","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222042","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/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]},{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel J. Rosenkrantz","raw_affiliation_strings":["State Univ. of New York at Albany"],"affiliations":[{"raw_affiliation_string":"State Univ. of New York at Albany","institution_ids":["https://openalex.org/I392282","https://openalex.org/I113508548"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086835651","display_name":"Harry B. Hunt","orcid":null},"institutions":[{"id":"https://openalex.org/I392282","display_name":"University at Albany, State University of New York","ror":"https://ror.org/012zs8222","country_code":"US","type":"education","lineage":["https://openalex.org/I392282"]},{"id":"https://openalex.org/I113508548","display_name":"Albany State University","ror":"https://ror.org/01vme4277","country_code":"US","type":"education","lineage":["https://openalex.org/I113508548"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Harry B. Hunt, III","raw_affiliation_strings":["State Univ. of New York at Albany"],"affiliations":[{"raw_affiliation_string":"State Univ. of New York at Albany","institution_ids":["https://openalex.org/I392282","https://openalex.org/I113508548"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009388396"],"corresponding_institution_ids":["https://openalex.org/I113508548","https://openalex.org/I392282"],"apc_list":null,"apc_paid":null,"fwci":1.0169,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74174849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"22","issue":"3","first_page":"627","last_page":"649"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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.9977999925613403,"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.9977999925613403,"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/monotone-polygon","display_name":"Monotone polygon","score":0.6380425691604614},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.541199266910553},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5149741768836975},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4889932870864868},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4854155480861664},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4585023522377014},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45613721013069153},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.44642069935798645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44467049837112427},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4196948707103729},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38776957988739014},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37018048763275146},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.27231380343437195},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.18173286318778992},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12012457847595215}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6380425691604614},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.541199266910553},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5149741768836975},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4889932870864868},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4854155480861664},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4585023522377014},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45613721013069153},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.44642069935798645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44467049837112427},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4196948707103729},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38776957988739014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37018048763275146},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.27231380343437195},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.18173286318778992},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12012457847595215},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0222042","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222042","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1492810367","https://openalex.org/W1527768578","https://openalex.org/W1557235141","https://openalex.org/W1650804443","https://openalex.org/W1655990431","https://openalex.org/W1666015432","https://openalex.org/W1784253675","https://openalex.org/W1967575124","https://openalex.org/W1997252335","https://openalex.org/W1998084650","https://openalex.org/W2002006950","https://openalex.org/W2017460507","https://openalex.org/W2019834939","https://openalex.org/W2022486658","https://openalex.org/W2027217469","https://openalex.org/W2039193071","https://openalex.org/W2054931299","https://openalex.org/W2063406991","https://openalex.org/W2077213022","https://openalex.org/W2080072194","https://openalex.org/W2096870603","https://openalex.org/W2164563727","https://openalex.org/W2914237983"],"related_works":["https://openalex.org/W1750931500","https://openalex.org/W4239032960","https://openalex.org/W4382322343","https://openalex.org/W1607525876","https://openalex.org/W4292381393","https://openalex.org/W4306295144","https://openalex.org/W3204916073","https://openalex.org/W1991547553","https://openalex.org/W3049543508","https://openalex.org/W4376312431"],"abstract_inverted_index":{"Hierarchical":[0],"object":[1],"descriptions":[2,9],"consisting":[3],"of":[4,7,28,44,49,61,75,97,122,209,220,240],"a":[5,17,22,33],"set":[6],"module":[8,14,19],"are":[10,70,112],"considered,":[11],"where":[12],"each":[13],"is":[15,25,57,65,80,104,135,169,201,225,234,245],"either":[16],"primitive":[18],"or":[20],"has":[21],"body":[23],"that":[24,82,131,138,143,172,237],"an":[26,205],"interconnection":[27],"submodules.":[29],"The":[30,47,59],"description":[31,103],"represents":[32],"flattened":[34],"object,":[35],"whose":[36],"size":[37,43,96,210,219],"can":[38,87,184],"be":[39,88,154,186],"exponential":[40],"in":[41,91,94,117,161,188],"the":[42,45,68,95,98,102,115,120,173,218,221,238],"description.":[46],"complexity":[48],"processing":[50],"and/or":[51],"analyzing":[52],"such":[53],"hierarchically":[54,62,76,83,124,177,197,242],"specified":[55,63,77,84,125,178,198,243],"objects":[56],"considered.":[58],"simulation":[60,133,174],"circuits":[64,86,180,217,244],"emphasized,":[66],"but":[67],"results":[69],"applicable":[71],"to":[72,119,156,203],"other":[73],"kinds":[74],"objects.":[78],"It":[79,168,233],"shown":[81,171,202,236],"acyclic":[85,126,179,199],"simulated":[89],"deterministically":[90],"space":[92],"linear":[93],"description,":[99],"even":[100],"when":[101],"not":[105],"explicitly":[106],"acyclic.":[107],"$\\Theta":[108],"(n^2":[109],")$-size-bounded":[110],"reductions":[111],"given":[113],"from":[114],"languages":[116,160],"${\\operatorname{DSPACE}}(n)$":[118,159],"problem":[121,134,175,239],"simulating":[123,241],"monotone":[127],"circuits.":[128,249],"This":[129],"implies":[130],"this":[132],"PSPACE-complete":[136],"and":[137],"any":[139],"algorithm":[140],"for":[141,176,247],"it":[142],"operates":[144],"faster":[145],"than":[146,163],"$2^{O(\\sqrt":[147,189,211],"n":[148,190,212,230],")}":[149,191,213],"$":[150,165,192],"deterministic":[151,166,193],"time":[152],"could":[153],"used":[155],"recognize":[157],"all":[158],"less":[162],"$2^{O(n)}":[164],"time.":[167,194],"then":[170],"(not":[181],"necessarily":[182],"monotone)":[183],"indeed":[185],"solved":[187],"Moreover,":[195],"every":[196],"circuit":[200,208,224],"have":[204],"equivalent":[206,222],"flat":[207,223],"$.":[214],"For":[215],"binary":[216],"$O(n^{{3":[226],"/":[227],"2}}":[228],"2^{1.53\\sqrt":[229],"}":[231],")$.":[232],"also":[235],"EXPSPACE-complete":[246],"cyclic":[248]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}