The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weighted multiway cuts in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conductance of order Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and sampling SCJ small parsimony solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating the vertices of a steiner tree in an arbitrary metric space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank

Revision as of 14:08, 17 July 2024

scientific article
Language Label Description Also known as
English
The computational complexity of calculating partition functions of optimal medians with Hamming distance
scientific article

    Statements

    The computational complexity of calculating partition functions of optimal medians with Hamming distance (English)
    0 references
    0 references
    0 references
    6 December 2018
    0 references
    computational complexity
    0 references
    partition function
    0 references
    median
    0 references
    genome rearrangement
    0 references
    single cut-or-join
    0 references
    FPRAS
    0 references
    FPAUS
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references