{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:39Z","timestamp":1750306359820,"version":"3.41.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T00:00:00Z","timestamp":1485820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Education and Science of Serbia","award":["174018"],"award-info":[{"award-number":["174018"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2017,1,31]]},"abstract":"<jats:p>\n            We study the (non-uniform) quantified constraint satisfaction problem QCSP(\n            <jats:italic>H<\/jats:italic>\n            ) as\n            <jats:italic>H<\/jats:italic>\n            ranges over semicomplete digraphs. We obtain a complexity-theoretic trichotomy: QCSP(\n            <jats:italic>H<\/jats:italic>\n            ) 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.\n          <\/jats:p>","DOI":"10.1145\/3007899","type":"journal-article","created":{"date-parts":[[2017,4,14]],"date-time":"2017-04-14T12:18:48Z","timestamp":1492172328000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantified Constraint Satisfaction Problem on Semicomplete Digraphs"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8355-1814","authenticated-orcid":false,"given":"Petar","family":"\u0110api\u0107","sequence":"first","affiliation":[{"name":"University of Novi Sad, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8355-1814","authenticated-orcid":false,"given":"Petar","family":"Markovi\u0107","sequence":"additional","affiliation":[{"name":"University of Novi Sad, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4642-8614","authenticated-orcid":false,"given":"Barnaby","family":"Martin","sequence":"additional","affiliation":[{"name":"Durham University, Durham, United Kindgom"}]}],"member":"320","published-online":{"date-parts":[[2017,4,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401029"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/070708093"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-008-9054-z"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725209"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01070906"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01267873"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.05.003"},{"key":"e_1_2_1_8_1","volume-title":"Math. Centrum 138","author":"Brouwer Andries E.","year":"1980","unstructured":"Andries E. Brouwer . 1980. The enumeration of locally transitive tournaments. Afd. Zuiv. Wisk ., Math. Centrum 138 ( 1980 ), 6pp. Andries E. Brouwer. 1980. The enumeration of locally transitive tournaments. Afd. Zuiv. Wisk., Math. Centrum 138 (1980), 6pp."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120582.1120584"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20712-9_14"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.50"},{"key":"e_1_2_1_13_1","volume-title":"Meditations on quantified constraint satisfaction. CoRR abs\/1201.6306","author":"Chen Hubie","year":"2012","unstructured":"Hubie Chen . 2012. Meditations on quantified constraint satisfaction. CoRR abs\/1201.6306 ( 2012 ). Appeared in Festschrift for Dexter Kozen 60th. Hubie Chen. 2012. Meditations on quantified constraint satisfaction. CoRR abs\/1201.6306 (2012). Appeared in Festschrift for Dexter Kozen 60th."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738866"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1968.27.95"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90132-J"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-96-01537-1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/076"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2010.11.002"},{"key":"e_1_2_1_21_1","volume-title":"Vardi","author":"Kolaitis Phokion G.","year":"2005","unstructured":"Phokion G. Kolaitis and Moshe Y . Vardi . 2005 . Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series). Springer-Verlag , New York, NY. Phokion G. Kolaitis and Moshe Y. Vardi. 2005. Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series). Springer-Verlag, New York, NY."},{"key":"e_1_2_1_22_1","first-page":"1","article-title":"Taylor operations on finite reflexive structures","volume":"1","author":"Larose B.","year":"2006","unstructured":"B. Larose . 2006 . Taylor operations on finite reflexive structures . Int. J. Math. Comput. Sci. 1 (2006), 1 -- 21 . B. Larose. 2006. Taylor operations on finite reflexive structures. Int. J. Math. Comput. Sci. 1 (2006), 1--21.","journal-title":"Int. J. Math. Comput. Sci."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38536-0_28"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-008-2122-9"},{"key":"e_1_2_1_26_1","unstructured":"Barnaby Martin. 2011. QCSP on partially reflexive forests. (2011). http:\/\/arxiv.org\/abs\/1103.6212 abridged conference version appeared in CP 2011.  Barnaby Martin. 2011. QCSP on partially reflexive forests. (2011). http:\/\/arxiv.org\/abs\/1103.6212 abridged conference version appeared in CP 2011."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780342_36"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP\u201914)","author":"Petar","year":"2014","unstructured":"Petar &Dstrok;api\u0107, Petar Markovi\u0107 , and Barnaby Martin . 2014 . QCSP on semicomplete digraphs . In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP\u201914) . 847--858. Petar &Dstrok;api\u0107, Petar Markovi\u0107, and Barnaby Martin. 2014. QCSP on semicomplete digraphs. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP\u201914). 847--858."},{"volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","key":"e_1_2_1_29_1","unstructured":"Christos H. Papadimitriou . 1994. Computational Complexity . Addison-Wesley . Christos H. Papadimitriou. 1994. Computational Complexity. Addison-Wesley."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-5547-1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_2_1_32_1","volume-title":"The size of generating sets of powers. Retrieved","author":"Zhuk Dmitriy","year":"2016","unstructured":"Dmitriy Zhuk . 2015. The size of generating sets of powers. Retrieved April 2, 2016 from http:\/\/arxiv.org\/ abs\/1504.02121. Dmitriy Zhuk. 2015. The size of generating sets of powers. Retrieved April 2, 2016 from http:\/\/arxiv.org\/ abs\/1504.02121."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3007899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3007899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:11Z","timestamp":1750222571000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3007899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,31]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1,31]]}},"alternative-id":["10.1145\/3007899"],"URL":"https:\/\/doi.org\/10.1145\/3007899","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2017,1,31]]},"assertion":[{"value":"2015-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}