Pages that link to "Item:Q5361877"
From MaRDI portal
The following pages link to Bipartite perfect matching is in quasi-NC (Q5361877):
Displaying 22 items.
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Improved hitting set for orbit of ROABPs (Q2087774) (← links)
- A real polynomial for bipartite graph minimum weight perfect matchings (Q2094360) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
- (Q4568108) (← links)
- (Q4612482) (← links)
- (Q4993296) (← links)
- From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- (Q5002729) (← links)
- (Q5002753) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- (Q5009475) (← links)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes (Q5232331) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)
