Pages that link to "Item:Q1199692"

The following pages link to Approximating the permanent of graphs with large factors (Q1199692):

Displaying 19 items.

• The complexity of generalized domino tilings (Q396923) (← links)
• Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← links)
• Rank-maximal matchings -- structure and algorithms (Q1733053) (← links)
• On the number of Eulerian orientations of a graph (Q1923856) (← links)
• Holographic reduction, interpolation and hardness (Q1926111) (← links)
• Spanning tree constrained determinantal point processes are hard to (approximately) evaluate (Q2060533) (← links)
• Computational complexity of three-dimensional discrete tomography with missing data (Q2231602) (← links)
• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← 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)
• Counting Minimal Dominating Sets (Q2988832) (← 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)
• (Q5009461) (← links)
• On the expansion of combinatorial polytopes (Q5096818) (← links)
• Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
• Bipartite 3-regular counting problems with mixed signs (Q5918683) (← links)
• Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)