{"id":"https://openalex.org/W1482905650","doi":"https://doi.org/10.4230/lipics.fsttcs.2012.148","title":"New bounds on the classical and quantum communication complexity of some graph properties","display_name":"New bounds on the classical and quantum communication complexity of some graph properties","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1482905650","doi":"https://doi.org/10.4230/lipics.fsttcs.2012.148","mag":"1482905650"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:3852","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.148","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.uva.nl/ws/files/50091814/12.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050912226","display_name":"G\u00e1bor Ivanyos","orcid":"https://orcid.org/0000-0003-3826-1735"},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Ivanyos, G\u00e1bor","raw_affiliation_strings":["Hungarian Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Hungarian Academy of Sciences","institution_ids":["https://openalex.org/I7597260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018075693","display_name":"Hartmut Klauck","orcid":"https://orcid.org/0000-0003-1078-4593"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Klauck, Hartmut","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083542323","display_name":"Troy Lee","orcid":"https://orcid.org/0000-0001-6912-2338"},"institutions":[{"id":"https://openalex.org/I115455960","display_name":"Centre for Quantum Technologies","ror":"https://ror.org/01mgdzc49","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115455960"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Lee, Troy","raw_affiliation_strings":["Centre for Quantum Technologies, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Centre for Quantum Technologies, Singapore, Singapore","institution_ids":["https://openalex.org/I115455960"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046562790","display_name":"Mikl\u00f3s S\u00e1ntha","orcid":null},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Santha, Miklos","raw_affiliation_strings":["Paris Diderot University"],"affiliations":[{"raw_affiliation_string":"Paris Diderot University","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066563480","display_name":"Ronald de Wolf","orcid":"https://orcid.org/0000-0001-5147-6090"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"de Wolf, Ronald","raw_affiliation_strings":["Centrum Wiskunde & Informatica#TAB#"],"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica#TAB#","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5050912226"],"corresponding_institution_ids":["https://openalex.org/I7597260"],"apc_list":null,"apc_paid":null,"fwci":1.3264,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82614287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9995999932289124,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9995999932289124,"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.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/T10083","display_name":"Graphene research and applications","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.6713977456092834},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.666895866394043},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.654904842376709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6291942596435547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6121420860290527},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5304733514785767},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4318254292011261},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.42855894565582275},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.412002831697464},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40044069290161133},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.10248121619224548},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08854809403419495}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6713977456092834},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.666895866394043},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.654904842376709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6291942596435547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6121420860290527},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5304733514785767},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4318254292011261},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.42855894565582275},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.412002831697464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40044069290161133},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.10248121619224548},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08854809403419495},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:3852","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.148","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:dare.uva.nl:openaire/d9f59eb4-85bd-42a5-b985-d1b3612563e9","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/new-bounds-on-the-classical-and-quantum-communication-complexity-of-some-graph-properties(d9f59eb4-85bd-42a5-b985-d1b3612563e9).html","pdf_url":"https://pure.uva.nl/ws/files/50091814/12.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Ivanyos, G, Klauck, H, Lee, T, Santha, M & de Wolf, R 2012, New bounds on the classical and quantum communication complexity of some graph properties. in D D'Souza, T Kavitha & J Radhakrishnan (eds), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, December 15-17, 2012 Hyderabad, India. Leibniz International Proceedings in Informatics, vol. 18, Saarbr\u00fccken/Wadern, pp. 148-159, 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 15/12/12. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.148","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:eprints.sztaki.hu:6864","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/6864/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/d9f59eb4-85bd-42a5-b985-d1b3612563e9","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/new-bounds-on-the-classical-and-quantum-communication-complexity-of-some-graph-properties(d9f59eb4-85bd-42a5-b985-d1b3612563e9).html","pdf_url":"https://dare.uva.nl/personal/pure/en/publications/new-bounds-on-the-classical-and-quantum-communication-complexity-of-some-graph-properties(d9f59eb4-85bd-42a5-b985-d1b3612563e9).html","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2012, December 15-17, 2012 Hyderabad, India, 148 - 159","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:cwi:oai:cwi.nl:20798","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/20798","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.6423","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.6423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cwi.nl/~rdewolf/publ/qc/qccgraph_fsttcs12.pdf","raw_type":"text"},{"id":"doi:10.4230/lipics.fsttcs.2012.148","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2012.148","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire/d9f59eb4-85bd-42a5-b985-d1b3612563e9","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/new-bounds-on-the-classical-and-quantum-communication-complexity-of-some-graph-properties(d9f59eb4-85bd-42a5-b985-d1b3612563e9).html","pdf_url":"https://pure.uva.nl/ws/files/50091814/12.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Ivanyos, G, Klauck, H, Lee, T, Santha, M & de Wolf, R 2012, New bounds on the classical and quantum communication complexity of some graph properties. in D D'Souza, T Kavitha & J Radhakrishnan (eds), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, December 15-17, 2012 Hyderabad, India. Leibniz International Proceedings in Informatics, vol. 18, Saarbr\u00fccken/Wadern, pp. 148-159, 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 15/12/12. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.148","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2007121016","display_name":null,"funder_award_id":"ANR-09-JCJC-0067-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2074700427","display_name":null,"funder_award_id":"DIQIP","funder_id":"https://openalex.org/F4320338463","funder_display_name":"CHIST-ERA"},{"id":"https://openalex.org/G2647417150","display_name":null,"funder_award_id":"639.072.803","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G3034753964","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"},{"id":"https://openalex.org/G3514550006","display_name":null,"funder_award_id":"Centre","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5509659972","display_name":null,"funder_award_id":"CHIST-ERA","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5830303806","display_name":null,"funder_award_id":"255961","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6851345361","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8051717526","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8277834823","display_name":"Quantum Cryptography: In Theory and Practice","funder_award_id":"ANR-09-JCJC-0067","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8430433013","display_name":null,"funder_award_id":"CHIST-ERA","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8730233624","display_name":null,"funder_award_id":"DIQIP","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320324089","display_name":"Centre for Quantum Technologies","ror":"https://ror.org/01mgdzc49"},{"id":"https://openalex.org/F4320338463","display_name":"CHIST-ERA","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1482905650.pdf","grobid_xml":"https://content.openalex.org/works/W1482905650.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W15553240","https://openalex.org/W125138126","https://openalex.org/W247655530","https://openalex.org/W251300907","https://openalex.org/W1493270085","https://openalex.org/W1540625694","https://openalex.org/W1599026900","https://openalex.org/W1631356911","https://openalex.org/W1969016943","https://openalex.org/W1977600272","https://openalex.org/W1979740015","https://openalex.org/W1980223785","https://openalex.org/W1991253503","https://openalex.org/W2012824096","https://openalex.org/W2016606569","https://openalex.org/W2030825457","https://openalex.org/W2038073775","https://openalex.org/W2053590396","https://openalex.org/W2070486524","https://openalex.org/W2080132708","https://openalex.org/W2086290259","https://openalex.org/W2101724873","https://openalex.org/W2107808918","https://openalex.org/W2114806597","https://openalex.org/W2119024683","https://openalex.org/W2120210041","https://openalex.org/W2143355494","https://openalex.org/W2157529519","https://openalex.org/W2170831059","https://openalex.org/W2266371753","https://openalex.org/W2340787257","https://openalex.org/W3037776276","https://openalex.org/W3100558667"],"related_works":["https://openalex.org/W2951369259","https://openalex.org/W2923741782","https://openalex.org/W2949620501","https://openalex.org/W2766479655","https://openalex.org/W2139539283","https://openalex.org/W3099594434","https://openalex.org/W2958797051","https://openalex.org/W3048053168","https://openalex.org/W3102549175","https://openalex.org/W2198492346","https://openalex.org/W2953295821","https://openalex.org/W2791305880","https://openalex.org/W2245961675","https://openalex.org/W3204122662","https://openalex.org/W2132936659","https://openalex.org/W2616752024","https://openalex.org/W1976310952","https://openalex.org/W3001954018","https://openalex.org/W2958617377","https://openalex.org/W2794500113"],"abstract_inverted_index":{"We":[0,181],"study":[1],"the":[2,12,15,29,43,58,105,141,174,188,213],"communication":[3,45,107,125,176,190],"complexity":[4,46,108,177,191],"of":[5,8,14,28,47,63,68,75,95,109,155,178,192,215],"a":[6,83,87,91,112,119,138,193,216],"number":[7],"graph":[9,16,52,85,113,148],"properties":[10],"where":[11],"edges":[13,30],"G":[17,53,206],"are":[18,134],"distributed":[19,217],"between":[20],"Alice":[21],"and":[22,90,118,158],"Bob":[23],"(i.e.,":[24],"each":[25],"receives":[26],"some":[27],"as":[31,198,209,211],"input).":[32],"Our":[33],"main":[34],"results":[35,172],"are:":[36],"1.":[37],"An":[38],"Omega(n)":[39,96],"lower":[40,93,132,167],"bound":[41,62,74,94,103,121,168],"on":[42],"quantum":[44,92,124,131,166,175,189],"deciding":[48,81,110,199],"whether":[49],"an":[50,115,152],"n-vertex":[51],"is":[54,202,207],"connected,":[55],"nearly":[56],"matching":[57],"trivial":[59],"classical":[60],"upper":[61,73],"O(n":[64],"log":[65,77],"n)":[66,78],"bits":[67,79],"communication.":[69],"2.":[70],"A":[71,101],"deterministic":[72],"O(n^{3/2}":[76],"for":[80,97,104,122,187],"if":[82,111,200,205],"bipartite":[84],"contains":[86],"perfect":[88],"matching,":[89],"this":[98],"problem.":[99],"3.":[100],"Theta(n^2)":[102],"randomized":[106],"has":[114],"Eulerian":[116],"tour,":[117],"Theta(n^{3/2})":[120],"its":[123],"complexity.":[126],"4.":[127],"The":[128,164],"first":[129],"two":[130],"bounds":[133,186],"obtained":[135],"by":[136],"exhibiting":[137],"reduction":[139],"from":[140,170],"n-bit":[142],"Inner":[143],"Product":[144],"problem":[145],"to":[146],"these":[147],"problems,":[149,196],"which":[150],"solves":[151],"open":[153],"question":[154],"Babai,":[156],"Frankl":[157],"Simon":[159],"[Babai":[160],"et":[161],"al":[162],"1986].":[163],"third":[165],"comes":[169],"recent":[171],"about":[173],"composed":[179],"functions.":[180],"also":[182],"obtain":[183],"essentially":[184],"tight":[185],"few":[194],"other":[195],"such":[197],"$G$":[201],"triangle-free,":[203],"or":[204],"bipartite,":[208],"well":[210],"computing":[212],"determinant":[214],"matrix.":[218]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}