{"id":"https://openalex.org/W2605983742","doi":"https://doi.org/10.1145/3007899","title":"Quantified Constraint Satisfaction Problem on Semicomplete Digraphs","display_name":"Quantified Constraint Satisfaction Problem on Semicomplete Digraphs","publication_year":2017,"publication_date":"2017-01-31","ids":{"openalex":"https://openalex.org/W2605983742","doi":"https://doi.org/10.1145/3007899","mag":"2605983742"},"language":"en","primary_location":{"id":"doi:10.1145/3007899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3007899","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1402851","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Petar \u0110api\u0107","orcid":"https://orcid.org/0000-0002-8355-1814"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Petar \u0110api\u0107","raw_affiliation_strings":["University of Novi Sad, Serbia"],"raw_orcid":"https://orcid.org/0000-0002-8355-1814","affiliations":[{"raw_affiliation_string":"University of Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023991085","display_name":"Petar Markovi\u0107","orcid":"https://orcid.org/0000-0002-8355-1814"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Petar Markovi\u0107","raw_affiliation_strings":["University of Novi Sad, Serbia"],"raw_orcid":"https://orcid.org/0000-0002-8355-1814","affiliations":[{"raw_affiliation_string":"University of Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013230954","display_name":"Barnaby Martin","orcid":"https://orcid.org/0000-0002-4642-8614"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Barnaby Martin","raw_affiliation_strings":["Durham University, Durham, United Kindgom"],"raw_orcid":"https://orcid.org/0000-0002-4642-8614","affiliations":[{"raw_affiliation_string":"Durham University, Durham, United Kindgom","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170726198"],"apc_list":null,"apc_paid":null,"fwci":0.474,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65122722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"18","issue":"1","first_page":"1","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.8772251605987549},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.8509231209754944},{"id":"https://openalex.org/keywords/trichotomy","display_name":"Trichotomy (philosophy)","score":0.8413679599761963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6912848949432373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4882197678089142},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4803279936313629},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47810953855514526},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4596834182739258},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4281271696090698},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0926571786403656}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8772251605987549},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.8509231209754944},{"id":"https://openalex.org/C2780233049","wikidata":"https://www.wikidata.org/wiki/Q13134154","display_name":"Trichotomy (philosophy)","level":2,"score":0.8413679599761963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6912848949432373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4882197678089142},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4803279936313629},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47810953855514526},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4596834182739258},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4281271696090698},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0926571786403656},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3007899","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3007899","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:20046","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/20046/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"ACM transactions on computational logic, 2017, Vol.18(1), pp.2 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1402851","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1402851","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1402851","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1402851","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"acceptedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1482193060","https://openalex.org/W1497273694","https://openalex.org/W1509092136","https://openalex.org/W1524176804","https://openalex.org/W1541356216","https://openalex.org/W1580855424","https://openalex.org/W1743712830","https://openalex.org/W1825515612","https://openalex.org/W1874576524","https://openalex.org/W1976017655","https://openalex.org/W1983788780","https://openalex.org/W1984074081","https://openalex.org/W1988961015","https://openalex.org/W1997649256","https://openalex.org/W2012141606","https://openalex.org/W2018470381","https://openalex.org/W2026753685","https://openalex.org/W2051731147","https://openalex.org/W2076946745","https://openalex.org/W2077575555","https://openalex.org/W2149922426","https://openalex.org/W2150339067","https://openalex.org/W2163162526","https://openalex.org/W2166566648","https://openalex.org/W2504299149","https://openalex.org/W2543643895","https://openalex.org/W2950740488","https://openalex.org/W2950900396","https://openalex.org/W4251337778","https://openalex.org/W4391177866"],"related_works":["https://openalex.org/W4302801350","https://openalex.org/W2950250288","https://openalex.org/W101741123","https://openalex.org/W2252314269","https://openalex.org/W2161128834","https://openalex.org/W2015204833","https://openalex.org/W2091348864","https://openalex.org/W1989984435","https://openalex.org/W2172276559","https://openalex.org/W2134850460"],"abstract_inverted_index":{"We":[0,17],"study":[1],"the":[2,41],"(non-uniform)":[3],"quantified":[4],"constraint":[5],"satisfaction":[6],"problem":[7],"QCSP(":[8,22],"H":[9,12,23],")":[10,24],"as":[11],"ranges":[13],"over":[14],"semicomplete":[15,47],"digraphs.":[16],"obtain":[18],"a":[19],"complexity-theoretic":[20],"trichotomy:":[21],"is":[25,29,32,40,55],"either":[26],"in":[27,58],"P,":[28],"NP-complete,":[30],"or":[31],"Pspace-complete.":[33],"The":[34],"largest":[35],"part":[36],"of":[37,44],"our":[38],"work":[39],"algebraic":[42],"classification":[43],"precisely":[45],"which":[46,54],"digraphs":[48],"enjoy":[49],"only":[50],"essentially":[51],"unary":[52],"polymorphisms,":[53],"combinatorially":[56],"interesting":[57],"its":[59],"own":[60],"right.":[61]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}