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 条

[1] BIPARTITE PERFECT MATCHING AS A REAL POLYNOMIAL
Beniamini, Gal
Nisan, Noam
[J]. ISRAEL JOURNAL OF MATHEMATICS, 2023, 256 (01) : 91 - 131
[2] A real polynomial for bipartite graph minimum weight perfect matchings
Trobst, Thorben
Vazirani, V. Vijay
[J]. INFORMATION PROCESSING LETTERS, 2023, 179
[3] On the bipartite unique perfect matching problem
Hoang, Thanh Minh
Mahajan, Meena
Thierauf, Thomas
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 453 - 464
[4] Online Bipartite Perfect Matching With Augmentations
Chaudhuri, Kamalika
Daskalakis, Constantinos
Kleinberg, Robert D.
Lin, Henry
[J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 1044 - +
[5] The labeled perfect matching in bipartite graphs
Monnot, J
[J]. INFORMATION PROCESSING LETTERS, 2005, 96 (03) : 81 - 88
[6] Boolean matching algorithm based on the perfect matching of the bipartite graph
Lu, ZW
Lin, ZH
Lei, Z
[J]. 2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, 2001, : 150 - 154
[7] A PERFECT MATCHING ALGORITHM FOR SPARSE BIPARTITE GRAPHS
TOCZYLOWSKI, E
[J]. DISCRETE APPLIED MATHEMATICS, 1984, 9 (03) : 263 - 268
[8] Bipartite Perfect Matching Is in Quasi-NC
Fenner, Stephen
Gurjar, Rohit
Thierauf, Thomas
[J]. STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 754 - 763
[9] BIPARTITE PERFECT MATCHING IS IN QUASI-NC
Fenner, Stephen
Gurjar, Rohit
Thierauf, Thomas
[J]. SIAM JOURNAL ON COMPUTING, 2021, 50 (03)
[10] A Deterministic Parallel Algorithm for Bipartite Perfect Matching
Fenner, Stephen
Gurjar, Rohit
Thierauf, Thomas
[J]. COMMUNICATIONS OF THE ACM, 2019, 62 (03) : 109 - 115

← 1 2 3 4 5 →