Pages that link to "Item:Q1321827"
From MaRDI portal
The following pages link to On the problem of approximating the number of bases of a matroid (Q1321827):
Displaying 10 items.
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- On Rota's problem about \(n\) bases in a rank \(n\) matroid (Q1338865) (← links)
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- (Q3358750) (← links)
- (Q4952721) (← links)
- (Q5196592) (← links)
- Bounding the number of bases of a matroid (Q5919124) (← links)
- On Mills's conjecture on matroids with many common bases (Q5948985) (← links)
- Quantum algorithms for learning hidden strings with applications to matroid problems (Q6199225) (← links)