The Dual Polynomial of Bipartite Perfect Matching

04/29/2020
by   Gal Beniamini, et al.
0

We obtain a description of the Boolean dual function of the Bipartite Perfect Matching decision problem, as a multilinear polynomial over the Reals. We show that in this polynomial, both the number of monomials and the magnitude of their coefficients are at most exponential in 𝒪(n log n). As an application, we obtain a new upper bound of 𝒪(n^1.5√(log n)) on the approximate degree of the bipartite perfect matching function, improving the previous best known bound of 𝒪(n^1.75). We deduce that, beyond a 𝒪(√(log n)) factor, the polynomial method cannot be used to improve the lower bound on the bounded-error quantum query complexity of bipartite perfect matching.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/21/2020

Bipartite Perfect Matching as a Real Polynomial

We obtain a description of the Bipartite Perfect Matching decision probl...
research
03/02/2022

Algebraic Representations of Unique Bipartite Perfect Matching

We obtain complete characterizations of the Unique Bipartite Perfect Mat...
research
06/10/2019

The Demand Query Model for Bipartite Matching

We introduce a `concrete complexity' model for studying algorithms for m...
research
03/19/2020

A Real Polynomial for Bipartite Graph Minimum Weight Perfect Matchings

In a recent paper, Beniamini and Nisan <cit.> gave a closed-form formula...
research
08/04/2022

Nearly Optimal Communication and Query Complexity of Bipartite Matching

We settle the complexities of the maximum-cardinality bipartite matching...
research
04/05/2022

Hall-type theorems for fast almost dynamic matching and applications

A dynamic set of size up to K is a set in which elements can be inserted...
research
09/16/2019

Vanishing-Error Approximate Degree and QMA Complexity

The ϵ-approximate degree of a function f X →{0, 1} is the least degree o...

Please sign up or login with your details

Forgot password? Click here to reset