An impossible combinatorial counting method in distance geometry (Q6558675)
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 7868439
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An impossible combinatorial counting method in distance geometry |
scientific article; zbMATH DE number 7868439 |
Statements
An impossible combinatorial counting method in distance geometry (English)
0 references
20 June 2024
0 references
distance geometry problem
0 references
branch-and-prune algorithm
0 references
solution symmetry
0 references
0 references
0 references
0 references
0 references
0 references
0.8150437474250793
0 references
0.8134191036224365
0 references
0.8026149868965149
0 references
0.7698935270309448
0 references
0.7679473757743835
0 references
