Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lee, Euiwoong, Svensson, Ola, Thiery, Theophile
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Data Structures and Algorithms Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2409.17831