The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds |
scientific article; zbMATH DE number 7939163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds |
scientific article; zbMATH DE number 7939163 |
Statements
The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (English)
0 references
5 November 2024
0 references
fine-grained complexity theory
0 references
non-deterministic finite automata
0 references
OMv hypothesis
0 references
CFL reachability
0 references
0 references
0 references
0 references
0 references
0 references
