The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs. (Q4982948)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6424537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs. |
scientific article; zbMATH DE number 6424537 |
Statements
13 April 2015
0 references
combinatorial Nullstellensatz
0 references
perfect matching
0 references
discrete Fourier transform
0 references
bipartite graphs
0 references
uncertainity principle
0 references
0.7471641898155212
0 references
0.7406080961227417
0 references
0.7406080961227417
0 references
0.7275514006614685
0 references
0.7069608569145203
0 references
