This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n20http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n7http://purl.org/net/nknouf/ns/bibtex#
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/subjekt/
n9http://linked.opendata.cz/ontology/domain/vavai/
n5https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n22http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n23http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F13%3A10145923%21RIV14-GA0-11320___/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F13%3A10145923%21RIV14-GA0-11320___
rdf:type
skos:Concept n9:Vysledek
dcterms:description
We show a dichotomy theorem for the computational complexity of the H-quasicover problem We show a dichotomy theorem for the computational complexity of the H-quasicover problem
dcterms:title
Dichotomy of the H-quasi-cover problem Dichotomy of the H-quasi-cover problem
skos:prefLabel
Dichotomy of the H-quasi-cover problem Dichotomy of the H-quasi-cover problem
skos:notation
RIV/00216208:11320/13:10145923!RIV14-GA0-11320___
n9:predkladatel
n10:orjk%3A11320
n3:aktivita
n8:S n8:P n8:I
n3:aktivity
I, P(GBP202/12/G061), P(LH12095), S
n3:dodaniDat
n19:2014
n3:domaciTvurceVysledku
n17:8385521 n17:4260686
n3:druhVysledku
n16:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n23:predkladatel
n3:idSjednocenehoVysledku
69427
n3:idVysledku
RIV/00216208:11320/13:10145923
n3:jazykVysledku
n14:eng
n3:klicovaSlova
dichotomy, quasicover; computational complexity
n3:klicoveSlovo
n6:quasicover n6:computational%20complexity n6:dichotomy
n3:kontrolniKodProRIV
[9A6938A575D6]
n3:mistoKonaniAkce
Ekaterinburg, Russia
n3:mistoVydani
Berlin Heidelberg
n3:nazevZdroje
Computer Science - Theory and Applications
n3:obor
n12:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n15:LH12095 n15:GBP202%2F12%2FG061
n3:rokUplatneniVysledku
n19:2013
n3:tvurceVysledku
Tesař, Marek Fiala, Jiří
n3:typAkce
n20:WRD
n3:zahajeniAkce
2013-06-25+02:00
s:numberOfPages
12
n22:doi
10.1007/978-3-642-38536-0_27
n7:hasPublisher
Springer-Verlag
n5:isbn
978-3-642-38535-3
n18:organizacniJednotka
11320