On the first-order complexity of induced subgraph isomorphism (Q5111210)
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: On the first-order complexity of induced subgraph isomorphism |
scientific article; zbMATH DE number 7204332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the first-order complexity of induced subgraph isomorphism |
scientific article; zbMATH DE number 7204332 |
Statements
26 May 2020
0 references
induced subgraph isomorphism problem
0 references
descriptive and computational complexity
0 references
finite-variable first-order logic
0 references
quantifier depth and variable width
0 references
On the First-Order Complexity of Induced Subgraph Isomorphism (English)
0 references
0.9791865944862366
0 references
0.8692861199378967
0 references
0.7920563817024231
0 references
0.790083646774292
0 references
0.7855368256568909
0 references
