Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents (Q1285571): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the Structure of the Strong Orientations of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle bases and bounds on the number of subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / 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: Q4184984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank

Revision as of 18:44, 28 May 2024

scientific article
Language Label Description Also known as
English
Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
scientific article

    Statements

    Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents (English)
    0 references
    0 references
    0 references
    28 April 1999
    0 references
    importance sampling
    0 references
    simulated annealing
    0 references
    \#P hard enumeration
    0 references
    permanents
    0 references
    handle basis representation
    0 references

    Identifiers