Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents

DOI10.1016/S0304-3975(99)80002-4zbMath0913.68070OpenAlexW2063793060MaRDI QIDQ1285571

Bjarne Andresen, Yaghout Nourani

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)80002-4

zbMATH Keywords

importance samplingsimulated annealingpermanents\#P hard enumerationhandle basis representation

Mathematics Subject Classification ID

Related Items

Quantifying machine flexibility

Cites Work

• Optimization by Simulated Annealing
• The complexity of computing the permanent
• A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
• Handle bases and bounds on the number of subgraphs
• Equation of State Calculations by Fast Computing Machines
• On the Structure of the Strong Orientations of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item