An implicit cover problem in wild population study
From MaRDI portal
Recommendations
Cites work
- A Parallel Repetition Theorem
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- On approximating four covering and packing problems
- Packing triangles in bounded degree graphs.
- Proof verification and the hardness of approximation problems
- Testing for heterogeneity of recombination fraction values in Human Genetics
Cited in
(2)
This page was built for publication: An implicit cover problem in wild population study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560058)