Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set

Nabil Mustafa

Domaines

Informatique
Fichier non déposé

Dates et versions

hal-02316988 , version 1 (15-10-2019)

Identifiants

  • HAL Id : hal-02316988 , version 1

Citer

Nabil Mustafa. Computing Optimal Epsilon-Nets Is as Easy as Finding an Unhit Set. 46th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2019, Patras, Greece. ⟨hal-02316988⟩
34 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More