{"id":"https://openalex.org/W2143355494","doi":"https://doi.org/10.1016/s0022-0000(02)00019-3","title":"A linear lower bound on the unbounded error probabilistic communication complexity","display_name":"A linear lower bound on the unbounded error probabilistic communication complexity","publication_year":2002,"publication_date":"2002-12-01","ids":{"openalex":"https://openalex.org/W2143355494","doi":"https://doi.org/10.1016/s0022-0000(02)00019-3","mag":"2143355494"},"language":"en","primary_location":{"id":"doi:10.1016/s0022-0000(02)00019-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(02)00019-3","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","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/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":true,"raw_author_name":"J\u00fcrgen Forster","raw_affiliation_strings":["Lehrstuhl Mathematik & Informatik, Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, 44780 Bochum, Germany","Lehrstuhl Math. & Inf., Ruhr-Univ., Bochum, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl Mathematik & Informatik, Fakult\u00e4t f\u00fcr Mathematik, Ruhr-Universit\u00e4t Bochum, 44780 Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]},{"raw_affiliation_string":"Lehrstuhl Math. & Inf., Ruhr-Univ., Bochum, Germany","institution_ids":["https://openalex.org/I904495901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026806256"],"corresponding_institution_ids":["https://openalex.org/I904495901"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":8.4529,"has_fulltext":false,"cited_by_count":186,"citation_normalized_percentile":{"value":0.97851579,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"65","issue":"4","first_page":"612","last_page":"625"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7546758055686951},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7230660319328308},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6388222575187683},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6153844594955444},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5537004470825195},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5490511059761047},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.47297894954681396},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46729332208633423},{"id":"https://openalex.org/keywords/m-matrix","display_name":"M-matrix","score":0.4233921468257904},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.41891443729400635},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.174218088388443},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07428810000419617},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06792372465133667}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7546758055686951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7230660319328308},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6388222575187683},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6153844594955444},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5537004470825195},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5490511059761047},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.47297894954681396},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46729332208633423},{"id":"https://openalex.org/C61987429","wikidata":"https://www.wikidata.org/wiki/Q3064355","display_name":"M-matrix","level":3,"score":0.4233921468257904},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.41891443729400635},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.174218088388443},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07428810000419617},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06792372465133667},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0022-0000(02)00019-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0022-0000(02)00019-3","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"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":"Journal of Computer and System Sciences","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.21.80","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.80","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.neurocolt.org/abs/2001/../../tech_reps/2001/01093.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W39337161","https://openalex.org/W1515707347","https://openalex.org/W1520252399","https://openalex.org/W1563088657","https://openalex.org/W1594563152","https://openalex.org/W1601740268","https://openalex.org/W1868906402","https://openalex.org/W1908291764","https://openalex.org/W2008671796","https://openalex.org/W2029538739","https://openalex.org/W2071020383","https://openalex.org/W2123750718","https://openalex.org/W2148603752","https://openalex.org/W2154904274","https://openalex.org/W2154952480","https://openalex.org/W2340787257","https://openalex.org/W2500622077","https://openalex.org/W2610857016","https://openalex.org/W2795056610","https://openalex.org/W2798909945","https://openalex.org/W2912956481","https://openalex.org/W4238284510","https://openalex.org/W6610271856","https://openalex.org/W6682756643"],"related_works":["https://openalex.org/W1513451900","https://openalex.org/W4288641573","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2949083013","https://openalex.org/W2328371232","https://openalex.org/W1590593970","https://openalex.org/W4297450461","https://openalex.org/W1481287275","https://openalex.org/W2037817744"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":7}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}