Minimal Counterexamples in O(n log n) Memory and O(n^2) Time.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/acsd/HansenK06
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/acsd/HansenK06
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Antti_Kervinen
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Henri_Hansen
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FACSD.2006.11
>
foaf:
homepage
<
https://doi.org/10.1109/ACSD.2006.11
>
dc:
identifier
DBLP conf/acsd/HansenK06
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FACSD.2006.11
(xsd:string)
dcterms:
issued
2006
(xsd:gYear)
rdfs:
label
Minimal Counterexamples in O(n log n) Memory and O(n^2) Time.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Antti_Kervinen
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Henri_Hansen
>
swrc:
pages
133-142
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/acsd/2006
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/acsd/HansenK06/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/acsd/HansenK06
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/acsd/acsd2006.html#HansenK06
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ACSD.2006.11
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/acsd
>
dc:
title
Minimal Counterexamples in O(n log n) Memory and O(n^2) Time.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document