Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/3302
DC FieldValueLanguage
dc.contributor.authorĐapić, Petaren
dc.contributor.authorMarković, Petaren
dc.contributor.authorMartin B.en
dc.date.accessioned2019-09-23T10:26:57Z-
dc.date.available2019-09-23T10:26:57Z-
dc.date.issued2017-04-01en
dc.identifier.issn15293785en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/3302-
dc.description.abstract© 2017 ACM. We study the (non-uniform) quantified constraint satisfaction problem QCSP(ℋ)asH ranges over semicomplete digraphs. We obtain a complexity-theoretic trichotomy: QCSP(ℋ) is either in P, is NP-complete, or is Pspace-complete. The largest part of our work is the algebraic classification of precisely which semicomplete digraphs enjoy only essentially unary polymorphisms, which is combinatorially interesting in its own right.en
dc.relation.ispartofACM Transactions on Computational Logicen
dc.titleQuantified constraint satisfaction problem on semicomplete digraphsen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1145/3007899en
dc.identifier.scopus2-s2.0-85018478998en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85018478998en
dc.relation.issue1en
dc.relation.volume18en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.parentorgPrirodno-matematički fakultet-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

4
checked on May 10, 2024

Page view(s)

18
Last Week
6
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.