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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F13%3A10174144%21RIV14-GA0-11320___
rdf:type
skos:Concept n14:Vysledek
rdfs:seeAlso
http://cjtcs.cs.uchicago.edu/
dcterms:description
We prove that if A is a large random relational structure ( with at least one relation of arity at least 2) then the homomorphism extension problem EXT (A) is almost surely NP-complete. We prove that if A is a large random relational structure ( with at least one relation of arity at least 2) then the homomorphism extension problem EXT (A) is almost surely NP-complete.
dcterms:title
Complexity of the homomorphism extension problem in random case Complexity of the homomorphism extension problem in random case
skos:prefLabel
Complexity of the homomorphism extension problem in random case Complexity of the homomorphism extension problem in random case
skos:notation
RIV/00216208:11320/13:10174144!RIV14-GA0-11320___
n14:predkladatel
n19:orjk%3A11320
n3:aktivita
n4:P n4:S
n3:aktivity
P(GA13-01832S), S
n3:cisloPeriodika
09
n3:dodaniDat
n17:2014
n3:domaciTvurceVysledku
n12:3372065
n3:druhVysledku
n13:J
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
66487
n3:idVysledku
RIV/00216208:11320/13:10174144
n3:jazykVysledku
n16:eng
n3:klicovaSlova
extension; homomorphism; Complexity
n3:klicoveSlovo
n9:homomorphism n9:Complexity n9:extension
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[1F6732A199DD]
n3:nazevZdroje
Chicago Journal of Theoretical Computer Science
n3:obor
n5:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n21:GA13-01832S
n3:rokUplatneniVysledku
n17:2013
n3:svazekPeriodika
2013
n3:tvurceVysledku
Kazda, Alexandr
s:issn
1073-0486
s:numberOfPages
6
n18:doi
10.4086/cjtcs.2013.009
n6:organizacniJednotka
11320