A lower bound for the topological complexity of poly(D,n) (Q1123617)
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 4110110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the topological complexity of poly(D,n) |
scientific article; zbMATH DE number 4110110 |
Statements
A lower bound for the topological complexity of poly(D,n) (English)
0 references
1989
0 references
branching nodes
0 references
computation nodes
0 references
topological complexity
0 references
computation trees
0 references
0.8373925685882568
0 references
0.8296643495559692
0 references
0.8218761682510376
0 references
