Incremental delay enumeration: Space and time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2018

Incremental delay enumeration: Space and time

Abstract

We investigate the relationship between several enumeration complexity classes andfocus in particular on problems having enumeration algorithms with incremental andpolynomial delay ( IncP andDelayP respectively). We show that, for some algorithms, wecan turn an average delay into a worst case delay without increasing the space complexity,suggesting that IncP1 = DelayP even with polynomially bounded space. We use theExponential Time Hypothesis to exhibit a strict hierarchy inside IncP which gives the firstseparation of DelayP andIncP. Finally we relate the uniform generation of solutions toprobabilistic enumeration algorithms with polynomial delay and polynomial space.
Fichier principal
Vignette du fichier
S0166218X18304001.pdf (412.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01923091 , version 1 (21-12-2021)

Licence

Attribution - NonCommercial

Identifiers

Cite

Florent Capelli, Yann Strozecki. Incremental delay enumeration: Space and time. Discrete Applied Mathematics, 2018, ⟨10.1016/j.dam.2018.06.038⟩. ⟨hal-01923091⟩
122 View
71 Download

Altmetric

Share

Gmail Facebook X LinkedIn More