How many needles are in a haystack, or how to solve \#P-complete counting problems fast (Q2433252): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on the cross-entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately Counting Hamilton Paths and Cycles in Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cross-entropy method for combinatorial and continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank

Latest revision as of 22:21, 24 June 2024

scientific article
Language Label Description Also known as
English
How many needles are in a haystack, or how to solve \#P-complete counting problems fast
scientific article

    Statements

    How many needles are in a haystack, or how to solve \#P-complete counting problems fast (English)
    0 references
    27 October 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Cross-entropy
    0 references
    Rare-event probability estimation
    0 references
    Hamilton cycles
    0 references
    Self-avoiding walks
    0 references
    Stochastic and simulation-based optimization
    0 references
    numerical examples
    0 references
    algorithms
    0 references
    dynamic importance sampling
    0 references
    minimum entropy
    0 references
    convergence
    0 references
    confidence intervals
    0 references
    0 references