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
dctermshttp://purl.org/dc/terms/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F09%3A00207021%21RIV10-GA0-11320___/
n3http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F09%3A00207021%21RIV10-GA0-11320___
rdf:type
n18:Vysledek skos:Concept
dcterms:description
For a fixed digraph G, the Constraint Satisfaction Problem with the template G, or CSP(G) for short, is the problem of deciding whether a given input digraph H admits a homomorphism to G. The dichotomy conjecture of Feder and Vardi states that CSP(G), for any choice of G, is solvable in polynomial time or NP-complete. This paper confirms the conjecture for a class of oriented trees called special triads. As a corollary we get the smallest known example of an oriented tree (with 39 vertices) defining an NP-complete CSP(G). For a fixed digraph G, the Constraint Satisfaction Problem with the template G, or CSP(G) for short, is the problem of deciding whether a given input digraph H admits a homomorphism to G. The dichotomy conjecture of Feder and Vardi states that CSP(G), for any choice of G, is solvable in polynomial time or NP-complete. This paper confirms the conjecture for a class of oriented trees called special triads. As a corollary we get the smallest known example of an oriented tree (with 39 vertices) defining an NP-complete CSP(G).
dcterms:title
CSP dichotomy for special triads CSP dichotomy for special triads
skos:prefLabel
CSP dichotomy for special triads CSP dichotomy for special triads
skos:notation
RIV/00216208:11320/09:00207021!RIV10-GA0-11320___
n4:aktivita
n12:Z n12:P
n4:aktivity
P(GA201/06/0664), P(GP201/09/P223), P(LC505), Z(MSM0021620839)
n4:cisloPeriodika
9
n4:dodaniDat
n8:2010
n4:domaciTvurceVysledku
n9:6798268 Kozik, Marcin
n4:druhVysledku
n17:J
n4:duvernostUdaju
n11:S
n4:entitaPredkladatele
n10:predkladatel
n4:idSjednocenehoVysledku
308645
n4:idVysledku
RIV/00216208:11320/09:00207021
n4:jazykVysledku
n19:eng
n4:klicovaSlova
dichotomy; special; triads
n4:klicoveSlovo
n15:special n15:triads n15:dichotomy
n4:kodStatuVydavatele
US - Spojené státy americké
n4:kontrolniKodProRIV
[A59A17479177]
n4:nazevZdroje
Proceedings of the American Mathematical Society
n4:obor
n7:BA
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
4
n4:projekt
n5:GA201%2F06%2F0664 n5:LC505 n5:GP201%2F09%2FP223
n4:rokUplatneniVysledku
n8:2009
n4:svazekPeriodika
137
n4:tvurceVysledku
Maróti, Miklos Niven, Todd Kozik, Marcin Barto, Libor
n4:wos
000269307400014
n4:zamer
n14:MSM0021620839
s:issn
0002-9939
s:numberOfPages
14
n3:organizacniJednotka
11320