Constraint satisfaction with countable homogeneous templates
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F06%3A00005324" target="_blank" >RIV/00216208:11320/06:00005324 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Constraint satisfaction with countable homogeneous templates
Original language description
For a fixed countable homogeneous relational structure $Gamma$ we study the computational problem whether a given finite structure of the same signature homomorphically maps to $Gamma$.
Czech name
CSP se spočetnými homogenními šablonami
Czech description
Pro pevnou spočetnou homogenní relační strukturu $Gamma$ studujeme problém, zda lze danou konečnou strukturu stejné signatury homomorficky zobrazit do $Gamma$.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Logic and Computation
ISSN
0955-792X
e-ISSN
—
Volume of the periodical
16
Issue of the periodical within the volume
3
Country of publishing house
GB - UNITED KINGDOM
Number of pages
15
Pages from-to
359-373
UT code for WoS article
—
EID of the result in the Scopus database
—