The computational complexity of calculating partition functions of optimal medians with Hamming distance.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/aam/MiklosS19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/aam/MiklosS19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Heather_C._Smith
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Istv%E2%88%9A%C2%B0n_Mikl%E2%88%9A%E2%89%A5s
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.aam.2018.09.002
>
foaf:
homepage
<
https://doi.org/10.1016/j.aam.2018.09.002
>
dc:
identifier
DBLP journals/aam/MiklosS19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.aam.2018.09.002
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/aam
>
rdfs:
label
The computational complexity of calculating partition functions of optimal medians with Hamming distance.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Heather_C._Smith
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Istv%E2%88%9A%C2%B0n_Mikl%E2%88%9A%E2%89%A5s
>
swrc:
pages
18-82
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/aam/MiklosS19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/aam/MiklosS19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/aam/aam102.html#MiklosS19
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.aam.2018.09.002
>
dc:
title
The computational complexity of calculating partition functions of optimal medians with Hamming distance.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
102
(xsd:string)