Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents. / Andresen, Bjarne.
I: Theoretical Computer Science, Nr. 251, 1999, s. 51-68.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
Andresen, B 1999, 'Exploration of NP-hard enumeration problems by simulated annealing - the spectrum values of permanents', Theoretical Computer Science, nr. 251, s. 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
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