Pages that link to "Item:Q3873544"
From MaRDI portal
The following pages link to The computational complexity of matroid properties (Q3873544):
Displaying 16 items.
- First order convergence of matroids (Q326662) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Tutte polynomials computable in polynomial time (Q686299) (← links)
- Recognizing graphic matroids (Q1172064) (← links)
- The computational complexity of knot and matroid polynomials (Q1313843) (← links)
- On the problem of approximating the number of bases of a matroid (Q1321827) (← links)
- On the efficiency of representability tests for matroids (Q1835922) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- Recognizing Polymatroids Associated with Hypergraphs (Q4290102) (← links)
- The computational complexity of antimatroid properties (Q5933438) (← links)
- Color-avoiding connected spanning subgraphs with minimum number of edges (Q6130205) (← links)
- On Fair Division under Heterogeneous Matroid Constraints (Q6135949) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
