Nearly Optimal Communication and Query Complexity of Bipartite Matching

We settle the complexities of the maximum-cardinality bipartite matching problem (BMM) up to polylogarithmic factors in five models of computation: the two-party communication, AND query, OR query, XOR query, and quantum edge query models. Our results answer open problems that have been raised repea...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 1174 - 1185
Main Authors:	Blikstad, Joakim, Van Den Brand, Jan, Efron, Yuval, Mukhopadhyay, Sagnik, Nanongkai, Danupon
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2022
Subjects:	Analytical models Complexity theory Computational modeling Computer science F.1.1 Models of Computation F.1.3 Complexity Measures and Classes F.2 Analysis of Algorithms and Problem Complexity Quantum computing
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!