Is there any O(2^n) algorithm you OS can run in almost no time?

Daniel Cosmin Porumbel

Conference Papers Year : 2022

Is there any O(2^n) algorithm you OS can run in almost no time?

(1)

1

Daniel Cosmin Porumbel

Function : Author
PersonId : 181822
IdHAL : danielporumbel
ORCID : 0000-0002-7478-3533

Centre d'études et de recherche en informatique et communications

Keywords

clivage entre programmation et théorie clivage entre réalité et théorie

Domains

Operations Research [math.OC] Combinatorics [math.CO]

main.pdf (340.02 Ko)

Origin	Files produced by the author(s)

CCSD Sciencesconf.org : Connect in order to contact the contributor

https://hal.science/hal-03597221

Submitted on : Friday, March 4, 2022-10:36:59 AM

Last modification on : Friday, July 19, 2024-11:38:04 AM

Dates and versions

hal-03597221 , version 1 (04-03-2022)

Identifiers

HAL Id : hal-03597221 , version 1

Cite

Daniel Cosmin Porumbel. Is there any O(2^n) algorithm you OS can run in almost no time?. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03597221⟩

Is there any O(2^n) algorithm you OS can run in almost no time?

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share