Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism (Q5222874)
From MaRDI portal
scientific article; zbMATH DE number 7076750
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism |
scientific article; zbMATH DE number 7076750 |
Statements
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism (English)
0 references
4 July 2019
0 references
subgraph isomorphism problem
0 references
descriptive complexity
0 references
computational complexity
0 references
first-order logic
0 references
quantifier depth
0 references
variable width
0 references
