Computing Tree-Depth Faster Than 2 n (Q2867079)
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 6237064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Tree-Depth Faster Than 2 n |
scientific article; zbMATH DE number 6237064 |
Statements
Computing Tree-Depth Faster Than 2 n (English)
0 references
10 December 2013
0 references
0.99950993
0 references
0.9180387
0 references
0.88133734
0 references
0.88133734
0 references
0.8741122
0 references
0.8741122
0 references
0 references
0.87108475
0 references
0 references
