{"id":"https://openalex.org/W2982608052","doi":"https://doi.org/10.1007/s00037-020-00194-8","title":"Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation","display_name":"Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W2982608052","doi":"https://doi.org/10.1007/s00037-020-00194-8","mag":"2982608052"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-020-00194-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-020-00194-8","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","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/A5071686980","display_name":"Or Meir","orcid":"https://orcid.org/0000-0001-5031-0750"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Or Meir","raw_affiliation_strings":["Department of Computer Science, University of Haifa, 3498838, Haifa, Israel","Department of Computer Science University of Haifa Haifa Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, 3498838, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":"Department of Computer Science University of Haifa Haifa Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071686980"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02735654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"1","first_page":"120","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9932000041007996,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9932000041007996,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9768999814987183,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplexer","display_name":"Multiplexer","score":0.7873499393463135},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7320212721824646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7311105132102966},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7021735906600952},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.6873050332069397},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5854471921920776},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5246003866195679},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5242319703102112},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43850553035736084},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.422793447971344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33998191356658936},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.2179294228553772},{"id":"https://openalex.org/keywords/multiplexing","display_name":"Multiplexing","score":0.168157160282135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1586378812789917},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11246681213378906},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06720983982086182},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.061074137687683105}],"concepts":[{"id":"https://openalex.org/C70970002","wikidata":"https://www.wikidata.org/wiki/Q189434","display_name":"Multiplexer","level":3,"score":0.7873499393463135},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7320212721824646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7311105132102966},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7021735906600952},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.6873050332069397},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5854471921920776},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5246003866195679},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5242319703102112},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43850553035736084},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.422793447971344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33998191356658936},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.2179294228553772},{"id":"https://openalex.org/C19275194","wikidata":"https://www.wikidata.org/wiki/Q222903","display_name":"Multiplexing","level":2,"score":0.168157160282135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1586378812789917},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11246681213378906},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06720983982086182},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.061074137687683105},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-020-00194-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-020-00194-8","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"mag:2982608052","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc26.html#Meir19","pdf_url":null,"source":{"id":"https://openalex.org/S4306509107","display_name":"Electron. Colloquium Comput. Complex.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1444168583","https://openalex.org/W1971361630","https://openalex.org/W2003104918","https://openalex.org/W2005223599","https://openalex.org/W2020913456","https://openalex.org/W2049016755","https://openalex.org/W2141585995","https://openalex.org/W2154150949","https://openalex.org/W2588984325","https://openalex.org/W2741968539","https://openalex.org/W2806321048","https://openalex.org/W2889405140","https://openalex.org/W4210551624"],"related_works":["https://openalex.org/W2588984325","https://openalex.org/W3184027254","https://openalex.org/W3046523482","https://openalex.org/W2807002780","https://openalex.org/W1997643965","https://openalex.org/W2039681975","https://openalex.org/W2169644995","https://openalex.org/W2952978069","https://openalex.org/W3157102507","https://openalex.org/W2950999115","https://openalex.org/W3127071357","https://openalex.org/W2982563860","https://openalex.org/W2949214562","https://openalex.org/W1542401186","https://openalex.org/W2295580398","https://openalex.org/W3035226643","https://openalex.org/W3214059917","https://openalex.org/W2462702417","https://openalex.org/W3083198661","https://openalex.org/W2947353914"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}