{"id":"https://openalex.org/W4399889428","doi":"https://doi.org/10.1145/3661814.3662069","title":"1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise","display_name":"1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise","publication_year":2024,"publication_date":"2024-06-21","ids":{"openalex":"https://openalex.org/W4399889428","doi":"https://doi.org/10.1145/3661814.3662069"},"language":"en","primary_location":{"id":"doi:10.1145/3661814.3662069","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3661814.3662069","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3661814.3662069","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085042017","display_name":"Lorenzo Ciardo","orcid":"https://orcid.org/0000-0001-9491-2016"},"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":true,"raw_author_name":"Lorenzo Ciardo","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-9491-2016","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045956843","display_name":"Marcin Kozik","orcid":"https://orcid.org/0000-0002-1839-4824"},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Kozik","raw_affiliation_strings":["Theoretical Computer Science Department, Jagiellonian University, Krakow, Poland"],"raw_orcid":"https://orcid.org/0000-0002-1839-4824","affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Jagiellonian University, Krakow, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003558662","display_name":"Andrei Krokhin","orcid":"https://orcid.org/0000-0003-4373-8227"},"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":"Andrei Krokhin","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-4373-8227","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072517256","display_name":"Tamio-Vesa Nakajima","orcid":"https://orcid.org/0000-0003-3684-9412"},"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":"Tamio-Vesa Nakajima","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-3684-9412","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"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, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-0263-159X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5085042017"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.6914,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.71564393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9966999888420105,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4119794964790344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3213275372982025}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4119794964790344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3213275372982025}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3661814.3662069","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3661814.3662069","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/547498","is_oa":true,"landing_page_url":"https://ruj.uj.edu.pl/handle/item/547498","pdf_url":"http://ruj.uj.edu.pl/bitstreams/a45aa440-c98f-4a57-bc11-db35b7217f22/download","source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publikacja pokonferencyjna"},{"id":"pmh:oai:durham-repository.worktribe.com:2925337","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/2925337","pdf_url":"https://durham-repository.worktribe.com/file/2925337/1/Published%20Journal%20Article","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":"publishedVersion"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:076528d4-ddf7-495a-8b9d-c29c33389386","is_oa":false,"landing_page_url":null,"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":"http://purl.org/coar/resource_type/c_dcae04bc"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:5077edde-072b-48f9-b702-dd0a51975c0f","is_oa":true,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:5077edde-072b-48f9-b702-dd0a51975c0f","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"}],"best_oa_location":{"id":"doi:10.1145/3661814.3662069","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3661814.3662069","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G114714254","display_name":null,"funder_award_id":"EP/R034516/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3441472509","display_name":"Promise Constraint Satisfaction Problem: Structure and Complexity","funder_award_id":"EP/X033201/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7416937612","display_name":"New Approaches to Approximability of Satisfiable Problems","funder_award_id":"EP/X024431/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7555447344","display_name":null,"funder_award_id":"EP/X033201/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8702647912","display_name":null,"funder_award_id":"EP/X024431/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"},{"id":"https://openalex.org/F4320322650","display_name":"Narodowym Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320336183","display_name":"Clarendon Fund","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1492972816","https://openalex.org/W1601269853","https://openalex.org/W1866703525","https://openalex.org/W1996983903","https://openalex.org/W2025319967","https://openalex.org/W2025904765","https://openalex.org/W2026753685","https://openalex.org/W2027524199","https://openalex.org/W2032980094","https://openalex.org/W2036265926","https://openalex.org/W2045583023","https://openalex.org/W2047861934","https://openalex.org/W2077575555","https://openalex.org/W2104254886","https://openalex.org/W2116407296","https://openalex.org/W2150339067","https://openalex.org/W2166566648","https://openalex.org/W2401610261","https://openalex.org/W2411816729","https://openalex.org/W2472217601","https://openalex.org/W2594596354","https://openalex.org/W2758570758","https://openalex.org/W2898776142","https://openalex.org/W2941546582","https://openalex.org/W2962785950","https://openalex.org/W2963666051","https://openalex.org/W2964303025","https://openalex.org/W2977636792","https://openalex.org/W2989790471","https://openalex.org/W3004384893","https://openalex.org/W3081785465","https://openalex.org/W3103815471","https://openalex.org/W3139029615","https://openalex.org/W3177905337","https://openalex.org/W3186467916","https://openalex.org/W3207594656","https://openalex.org/W3212768336","https://openalex.org/W4206427716","https://openalex.org/W4239919431","https://openalex.org/W4294630911","https://openalex.org/W4309765048","https://openalex.org/W4316652373","https://openalex.org/W4376639550","https://openalex.org/W4376639551","https://openalex.org/W4384344714","https://openalex.org/W6689367332","https://openalex.org/W6948045647"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"The":[0],"1-in-3":[1,19],"and":[2,54],"Not-All-Eqal":[3,21],"satisfiability":[4],"problems":[5],"for":[6,59],"Boolean":[7],"CNF":[8],"formulas":[9],"are":[10],"two":[11],"well-known":[12],"NP-hard":[13],"problems.":[14,65],"In":[15,29],"contrast,":[16],"the":[17,30,43,60],"promise":[18,44],"vs.":[20],"problem":[22,38],"can":[23],"be":[24],"solved":[25],"in":[26,39],"polynomial":[27],"time.":[28],"present":[31],"work,":[32],"we":[33],"investigate":[34],"this":[35],"constraint":[36],"satisfaction":[37],"a":[40,51,56],"regime":[41],"where":[42],"is":[45],"weakened":[46],"from":[47],"either":[48],"side":[49],"by":[50],"rainbow-free":[52],"structure,":[53],"establish":[55],"complexity":[57],"dichotomy":[58],"resulting":[61],"class":[62],"of":[63],"computational":[64]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}