{"id":"https://openalex.org/W3155570673","doi":"https://doi.org/10.1145/3508069","title":"QCSP on Reflexive Tournaments","display_name":"QCSP on Reflexive Tournaments","publication_year":2022,"publication_date":"2022-04-06","ids":{"openalex":"https://openalex.org/W3155570673","doi":"https://doi.org/10.1145/3508069","mag":"3155570673"},"language":"en","primary_location":{"id":"doi:10.1145/3508069","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3508069","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":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2104.10570","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016192081","display_name":"Beno\u00eet Larose","orcid":null},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Beno\u00eet Larose","raw_affiliation_strings":["LACIM, Universit\u00e9 du Qu\u00e9bec a Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LACIM, Universit\u00e9 du Qu\u00e9bec a Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I159129438"]}]},{"author_position":"middle","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":["Department of Computer Science, Durham University, Durham, UK"],"raw_orcid":"https://orcid.org/0000-0002-4642-8614","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"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":["Department of Mathematics and Informatics, University of Novi Sad, Novi Sad, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Informatics, University of Novi Sad, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"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":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003084202","display_name":"Siani Smith","orcid":"https://orcid.org/0000-0003-0797-0512"},"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":"Siani Smith","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067656814","display_name":"Stanislav \u017divn\u00fd","orcid":"https://orcid.org/0000-0002-0263-159X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stanislav \u017divn\u00fd","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, UK"],"raw_orcid":"https://orcid.org/0000-0002-0263-159X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2651,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51205791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"23","issue":"3","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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":0.9998999834060669,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9941999912261963,"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/combinatorics","display_name":"Combinatorics","score":0.7266777753829956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.721673309803009},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7005071640014648},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.6600379943847656},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.49132028222084045},{"id":"https://openalex.org/keywords/reflexivity","display_name":"Reflexivity","score":0.4172327518463135},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3357650637626648},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2067016363143921},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0838354229927063}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7266777753829956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.721673309803009},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7005071640014648},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.6600379943847656},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.49132028222084045},{"id":"https://openalex.org/C13200473","wikidata":"https://www.wikidata.org/wiki/Q2747831","display_name":"Reflexivity","level":2,"score":0.4172327518463135},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3357650637626648},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2067016363143921},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0838354229927063},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1145/3508069","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3508069","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:34958","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/34958/","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":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 2022, Vol.23(3), pp.1-22 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:2104.10570","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.10570","pdf_url":"https://arxiv.org/pdf/2104.10570","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:cc71d348-e977-4746-9714-b6cfa88d8f56","is_oa":true,"landing_page_url":null,"pdf_url":"https://ora.ox.ac.uk/objects/uuid:cc71d348-e977-4746-9714-b6cfa88d8f56","source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"},{"id":"pmh:oai:durham-repository.worktribe.com:1218904","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1218904","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":"Journal Article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:b99ea8d1-d391-4314-b0ec-5090bd33b5ee","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:b99ea8d1-d391-4314-b0ec-5090bd33b5ee","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Journal article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/141d9938-f203-4ffe-9999-67d6c2969bb9","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/141d9938-f203-4ffe-9999-67d6c2969bb9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Larose, B, Martin, B, Markovi\u0107, P, Paulusma, D, Smith, S & \u017divn\u00fd, S 2022, 'QCSP on Reflexive Tournaments', ACM Transactions on Computational Logic, vol. 23, no. 3, 14. https://doi.org/10.1145/3508069","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/141d9938-f203-4ffe-9999-67d6c2969bb9","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/141d9938-f203-4ffe-9999-67d6c2969bb9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Larose, B, Martin, B, Markovi\u0107, P, Paulusma, D, Smith, S & \u017divn\u00fd, S 2022, 'QCSP on Reflexive Tournaments', ACM Transactions on Computational Logic, vol. 23, no. 3, 14. https://doi.org/10.1145/3508069","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.4230/lipics.esa.2021.58","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2021.58","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2104.10570","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.10570","pdf_url":"https://arxiv.org/pdf/2104.10570","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3202555970","display_name":null,"funder_award_id":"714532","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8289854410","display_name":null,"funder_award_id":"451-03-68/2002-14/200125","funder_id":"https://openalex.org/F4320322729","funder_display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322729","display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","ror":"https://ror.org/01znas443"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W929955757","https://openalex.org/W1580855424","https://openalex.org/W1795713683","https://openalex.org/W1855557781","https://openalex.org/W1968948791","https://openalex.org/W1996330905","https://openalex.org/W1998601876","https://openalex.org/W2023673835","https://openalex.org/W2026753685","https://openalex.org/W2029406200","https://openalex.org/W2051731147","https://openalex.org/W2056827961","https://openalex.org/W2076946745","https://openalex.org/W2150339067","https://openalex.org/W2395088789","https://openalex.org/W2605983742","https://openalex.org/W2773731510","https://openalex.org/W2962785950","https://openalex.org/W2963569011","https://openalex.org/W2963768895","https://openalex.org/W3033293777","https://openalex.org/W3035200231","https://openalex.org/W3081785465","https://openalex.org/W3106476167","https://openalex.org/W3174667360","https://openalex.org/W4214702250"],"related_works":["https://openalex.org/W2354251330","https://openalex.org/W2383468429","https://openalex.org/W1981770164","https://openalex.org/W2353691047","https://openalex.org/W2910480389","https://openalex.org/W2397412345","https://openalex.org/W2045621845","https://openalex.org/W2988746064","https://openalex.org/W2009004645","https://openalex.org/W2886475100"],"abstract_inverted_index":{"We":[0,72],"give":[1],"a":[2,19,33],"complexity":[3],"dichotomy":[4],"for":[5],"the":[6],"Quantified":[7],"Constraint":[8],"Satisfaction":[9],"Problem":[10],"\\(":[11,15,39,53,60,67,76,94,99,105,109],"\\mathrm{QCSP}(\\mathrm{H})":[12,95,106],"\\)":[13,17,42,55,62,70,78,96,102,107,112],"when":[14],"\\mathrm{H}":[16,77],"is":[18,23,97,108],"reflexive":[20,27],"tournament.":[21],"It":[22],"well":[24],"known":[25],"that":[26,44,74],"tournaments":[28],"can":[29],"be":[30],"split":[31],"into":[32],"sequence":[34],"of":[35,52,59,90],"strongly":[36,85],"connected":[37,86],"components":[38],"\\mathrm{H}_1,\\ldots":[40],",\\mathrm{H}_n":[41],"so":[43],"there":[45],"exists":[46],"an":[47],"edge":[48],"from":[49],"every":[50,57],"vertex":[51,58],"\\mathrm{H}_i":[54],"to":[56],"\\mathrm{H}_j":[61],"if":[63,66,75],"and":[64,83,103],"only":[65],"i\\lt":[68],"j":[69],".":[71],"prove":[73],"has":[79],"both":[80],"its":[81],"initial":[82],"final":[84],"component":[87],"(possibly":[88],"equal)":[89],"size":[91],"1,":[92],"then":[93],"in":[98],"\\mathsf":[100,110],"{NL}":[101],"otherwise":[104],"{NP}":[111],"-hard.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}