Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
type: Item
instance of: scholarly article
title: Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
zbMATH Open document ID: 0913.68070
DOI: 10.1016/S0304-3975(99)80002-4
author: Yaghout Nourani
author: Bjarne Andresen
published in: Theoretical Computer Science
publication date: 1999-04-28T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1281072
zbMATH Keywords: importance sampling
zbMATH Keywords: simulated annealing
zbMATH Keywords: \#P hard enumeration
zbMATH Keywords: permanents
zbMATH Keywords: handle basis representation
MaRDI profile type: Publication
cites work: On the Structure of the Strong Orientations of a Graph
cites work: A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
cites work: Handle bases and bounds on the number of subgraphs
cites work: Q4198056
cites work: Q4230355
cites work: Q4142699
cites work: Q3262596
cites work: Optimization by Simulated Annealing
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q4184984
cites work: Q4111065
cites work: Q4858974
cites work: Q3135094
cites work: The complexity of computing the permanent
cites work: Q3785827
full work available at URL: s0304-3975(99)80002-4
OpenAlex ID: W2063793060
description: scientific article; zbMATH DE number 1281072