The Complexity of Temporal Constraint Satisfaction Problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00206090" target="_blank" >RIV/00216208:11320/08:00206090 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The Complexity of Temporal Constraint Satisfaction Problems
Original language description
Annotation in the original language is: A temporal constraint language is a set of relations that has a first-order definition in the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem for temporal constraint languages.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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)
Others
Publication year
2008
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
Article name in the collection
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008
ISBN
978-1-60558-047-0
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
ACM
Place of publication
USA
Event location
USA
Event date
Jan 1, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—