{"id":"https://openalex.org/W1515707347","doi":"https://doi.org/10.1007/3-540-45294-x_15","title":"Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity","display_name":"Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1515707347","doi":"https://doi.org/10.1007/3-540-45294-x_15","mag":"1515707347"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45294-x_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45294-x_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5026806256","display_name":"J\u00fcrgen Forster","orcid":null},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Forster","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780, Bochum, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780, Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088337575","display_name":"Matthias Krause","orcid":"https://orcid.org/0000-0002-3200-3199"},"institutions":[{"id":"https://openalex.org/I177802217","display_name":"University of Mannheim","ror":"https://ror.org/031bsb921","country_code":"DE","type":"education","lineage":["https://openalex.org/I177802217"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Krause","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Mannheim, D-68131, Mannheim, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Mannheim, D-68131, Mannheim, Germany","institution_ids":["https://openalex.org/I177802217"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069623436","display_name":"Satyanarayana V. Lokam","orcid":"https://orcid.org/0000-0002-0218-6668"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satyanarayana V. Lokam","raw_affiliation_strings":["School of Mathematics, Institute for Advanced Study, 08540, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Institute for Advanced Study, 08540, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070089253","display_name":"Rustam Mubarakzjanov","orcid":null},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rustam Mubarakzjanov","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Trier, D-54286, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Trier, D-54286, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080029298","display_name":"Niels Schmitt","orcid":"https://orcid.org/0000-0002-8329-6833"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Niels Schmitt","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780, Bochum, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780, Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032272542","display_name":"Hans Ulrich Simon","orcid":"https://orcid.org/0000-0002-1587-0944"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hans Ulrich Simon","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780, Bochum, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, D-44780, Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.3444,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.9126506,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"182"},"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.9998999834060669,"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.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"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/T10237","display_name":"Cryptography and Data Security","score":0.9979000091552734,"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/communication-complexity","display_name":"Communication complexity","score":0.7612252235412598},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6771411299705505},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.6020581722259521},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5963404178619385},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5471266508102417},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5377144813537598},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5281398892402649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4931640028953552},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.48624956607818604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4784833788871765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4718320965766907},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.4636686146259308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45058247447013855},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.4488329589366913},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.44622910022735596},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4171870946884155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29531329870224},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.29291895031929016}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7612252235412598},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6771411299705505},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.6020581722259521},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5963404178619385},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5471266508102417},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5377144813537598},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5281398892402649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4931640028953552},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.48624956607818604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4784833788871765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4718320965766907},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.4636686146259308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45058247447013855},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.4488329589366913},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.44622910022735596},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4171870946884155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29531329870224},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.29291895031929016},{"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/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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},{"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/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45294-x_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45294-x_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:ub-madoc.bib.uni-mannheim.de:59807","is_oa":false,"landing_page_url":"https://madoc.bib.uni-mannheim.de/59807/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196315","display_name":"MADOC (University of Mannheim)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177802217","host_organization_name":"University of Mannheim","host_organization_lineage":["https://openalex.org/I177802217"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Konferenzver\u00f6ffentlichung"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W137193333","https://openalex.org/W143396352","https://openalex.org/W286143319","https://openalex.org/W1488809080","https://openalex.org/W1516726196","https://openalex.org/W1563088657","https://openalex.org/W1601740268","https://openalex.org/W1846794677","https://openalex.org/W1868906402","https://openalex.org/W2008671796","https://openalex.org/W2031208839","https://openalex.org/W2069516228","https://openalex.org/W2071020383","https://openalex.org/W2080210666","https://openalex.org/W2097957732","https://openalex.org/W2117508909","https://openalex.org/W2123750718","https://openalex.org/W2129774539","https://openalex.org/W2143355494","https://openalex.org/W2154904274","https://openalex.org/W2890843275","https://openalex.org/W4236318822","https://openalex.org/W4249560439"],"related_works":["https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W342214647","https://openalex.org/W2964237202","https://openalex.org/W2041069649","https://openalex.org/W1988772559","https://openalex.org/W1572916600","https://openalex.org/W2555446247","https://openalex.org/W2047754121","https://openalex.org/W3094951835"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}