Tree-Depth and the Formula Complexity of Subgraph Isomorphism (Q5885602)
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: Tree-Depth and the Formula Complexity of Subgraph Isomorphism |
scientific article; zbMATH DE number 7672230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tree-Depth and the Formula Complexity of Subgraph Isomorphism |
scientific article; zbMATH DE number 7672230 |
Statements
Tree-Depth and the Formula Complexity of Subgraph Isomorphism (English)
0 references
4 April 2023
0 references
circuit complexity
0 references
subgraph isomorphism
0 references
tree-width
0 references
0.8474103212356567
0 references
0.7910199165344238
0 references
0.7785620093345642
0 references
0.7700698971748352
0 references
