Counting and sampling SCJ small parsimony solutions (Q740977)
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: Counting and sampling SCJ small parsimony solutions |
scientific article; zbMATH DE number 6342270
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and sampling SCJ small parsimony solutions |
scientific article; zbMATH DE number 6342270 |
Statements
Counting and sampling SCJ small parsimony solutions (English)
0 references
10 September 2014
0 references
computations on discrete structures
0 references
counting problems
0 references
single cut and join
0 references
FPAUS
0 references
FPRAS
0 references
non-approximability
0 references
0 references
0.8103887
0 references
0.80301577
0 references
0.79776937
0 references
0.7969459
0 references
