Pages that link to "Item:Q6065237"
From MaRDI portal
The following pages link to Bipartite perfect matching as a real polynomial (Q6065237):
Displaying 4 items.
- A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
- A real polynomial for bipartite graph minimum weight perfect matchings (Q2094360) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Representing polynomial of \textsc{St-Connectivity} (Q6599807) (← links)