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

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents. / Andresen, Bjarne.

In: Theoretical Computer Science, No. 251, 1999, p. 51-68.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Andresen, B 1999, 'Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents', Theoretical Computer Science, no. 251, pp. 51-68.

APA

Andresen, B. (1999). Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents. Theoretical Computer Science, (251), 51-68.

Vancouver

Andresen B. Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents. Theoretical Computer Science. 1999;(251):51-68.

Author

Andresen, Bjarne. / Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents. In: Theoretical Computer Science. 1999 ; No. 251. pp. 51-68.

Bibtex

@article{ced8886074c811dbbee902004c4f4f50,
title = "Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents",
author = "Bjarne Andresen",
year = "1999",
language = "English",
pages = "51--68",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "251",

}

RIS

TY - JOUR

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

AU - Andresen, Bjarne

PY - 1999

Y1 - 1999

M3 - Journal article

SP - 51

EP - 68

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 251

ER -

ID: 188331