Near-Optimal Complexity Bounds for Fragments of the Skolem Problem (Q5874310)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7650922
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-Optimal Complexity Bounds for Fragments of the Skolem Problem |
scientific article; zbMATH DE number 7650922 |
Statements
7 February 2023
0 references
linear recurrences
0 references
Skolem problem
0 references
NP-completeness
0 references
weighted automata
0 references
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem (English)
0 references
