Pages that link to "Item:Q1199692"
From MaRDI portal
The following pages link to Approximating the permanent of graphs with large factors (Q1199692):
Displayed 6 items.
- On the number of Eulerian orientations of a graph (Q1923856) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- A load balancing strategy for parallel computation of sparse permanents (Q2864488) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- On the Number of α-Orientations (Q3508567) (← links)