Tight bounds on the asymptotic descriptive complexity of subgraph isomorphism (Q5222874)
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: Tight bounds on the asymptotic descriptive complexity of subgraph isomorphism |
scientific article; zbMATH DE number 7076750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8807210922241211
0 references
0.8700215816497803
0 references
0.8172842264175415
0 references
0.8124305009841919
0 references
0.7941479086875916
0 references
