The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds

Fiche du document

Auteurs

Date

4 octobre 2024

Discipline

Type de document

Articles

Périmètre

Publications

Identifiants

ISIDORE Id: 10670/1.9c7564...
doi: 10.46298/theoretics.24.22

Source

Episciences.org

Collection

Archives ouvertes

Organisation

Centre pour la communication scientifique directe

Licences

info:eu-repo/semantics/openAccess , info:eu-repo/semantics/openAccess

Mots-clés Und

Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms Computer Science - Formal Languages and Automata Theory

Sujets proches En

Supposition Assumption

Citer ce document

Karl Bringmann et al., « The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds », Episciences.org, ID : 10.46298/theoretics.24.22

Partage / Export

document thumbnail