Stochastic enumeration method for counting NP-hard problems (Q352890): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11009-011-9242-y / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11009-011-9242-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067049422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Monte Carlo simulation via the generalized splitting method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Multilevel Splitting for Rare Event Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Monte Carlo for rare event estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of the Pivot algorithm for self-avoiding walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Splitting for Estimating Rare Event Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Step Branching Splitting Model Under Cost Constraint for Rare Event Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: SampleSearch: importance sampling in presence of determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo methods for the self-avoiding walk / 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: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RARE EVENT SIMULATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo strategies in scientific computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. / 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: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the permanent: A simple approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Number of s-t Paths in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gibbs cloner for combinatorial optimization, counting and sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation and the Monte Carlo Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11009-011-9242-Y / rank
 
Normal rank

Latest revision as of 15:07, 9 December 2024

scientific article
Language Label Description Also known as
English
Stochastic enumeration method for counting NP-hard problems
scientific article

    Statements

    Stochastic enumeration method for counting NP-hard problems (English)
    0 references
    5 July 2013
    0 references
    rare-event
    0 references
    self-avoiding walks
    0 references
    satisfiability
    0 references
    splitting
    0 references
    Markov chain Monte Carlo method
    0 references
    numerical examples
    0 references
    sequential importance sampling algorithm
    0 references
    stochastic enumeration
    0 references
    one-step-look-ahead algorithm
    0 references
    polynomial time decision making
    0 references
    sample search methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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