Bipartite Perfect Matching as a Real Polynomial

被引：4

作者：

Beniamini, Gal ^{[1
]}

Nisan, Noam ^{[1
]}

机构：

[1] Hebrew Univ Jerusalem, Jerusalem, Israel

来源：

STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING | 2021年

基金：

欧洲研究理事会;

关键词：

Bipartite Perfect Matching; Boolean Functions; Elementary Graphs;

D O I：

10.1145/3406325.3451002

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and (1 - o(n)(1)) . 2(n2) monomials with non-zero coefficients. In contrast, we show that in the dual representation (switching the roles of 0 and 1) the number of monomials is only exponential in Theta(n log n). Our proof relies heavily on the fact that the lattice of graphs which are "matching-covered" is Eulerian.

引用

页码：1118 / 1131

页数：14

共 50 条

[31] Smallest Close to Regular Bipartite Graphs without an Almost Perfect Matching
Lutz VOLKMANN
Axel ZINGSEM
[J]. Acta Mathematica Sinica,English Series, 2010, 26 (08) : 1403 - 1412
[32] Exact weight perfect matching of bipartite graph is NP-complete
Zhu, Guohun
Luo, Xiangyu
Miao, Yuqing
[J]. WORLD CONGRESS ON ENGINEERING 2008, VOLS I-II, 2008, : 878 - 880
[33] Using bipartite and multidimensional matching to select the roots of a system of polynomial equations
Bekker, H
Braad, EP
Goldengorin, B
[J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, VOL 4, PROCEEDINGS, 2005, 3483 : 397 - 406
[34] SOLUTION TO A PROBLEM OF CD GODSIL REGARDING BIPARTITE GRAPHS WITH UNIQUE PERFECT MATCHING
SIMION, R
CAO, DS
[J]. COMBINATORICA, 1989, 9 (01) : 85 - 89
[35] An optimal data association method based on the minimum weighted bipartite perfect matching
Xinzheng Zhang
A. B. Rad
Guoquan Huang
Y. K. Wong
[J]. Autonomous Robots, 2016, 40 : 77 - 91
[36] An optimal data association method based on the minimum weighted bipartite perfect matching
Zhang, Xinzheng
Rad, A. B.
Huang, Guoquan
Wong, Y. K.
[J]. AUTONOMOUS ROBOTS, 2016, 40 (01) : 77 - 91
[37] A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs
Asathulla, Mudabir Kabir
Khanna, Sanjeev
Lahn, Nathaniel
Raghvendra, Sharath
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (01)
[38] Monotone multilinear boolean circuits for bipartite perfect matching require exponential size
Ponnuswami, AK
Venkateswaran, H
[J]. FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2004, 3328 : 460 - 468
[39] On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching II
Barik, Sasmita
Behera, Subhasish
[J]. LINEAR & MULTILINEAR ALGEBRA, 2024, 72 (08): : 1356 - 1374
[40] A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs
Asathulla, Mudabir Kabir
Khanna, Sanjeev
Lahn, Nathaniel
Raghvendra, Sharath
[J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 457 - 476

← 1 2 3 4 5 →