{"id":"https://openalex.org/W7128604038","doi":"https://doi.org/10.48550/arxiv.2602.09576","title":"On the complexity of Sandwich Problems for $M$-partitions","display_name":"On the complexity of Sandwich Problems for $M$-partitions","publication_year":2026,"publication_date":"2026-02-10","ids":{"openalex":"https://openalex.org/W7128604038","doi":"https://doi.org/10.48550/arxiv.2602.09576"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.09576","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125653495","display_name":"Alexey Barsukov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barsukov, Alexey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5099381063","display_name":"Santiago Guzm\u00e1n-Pro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guzm\u00e1n-Pro, Santiago","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20556734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6281999945640564,"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.6281999945640564,"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.10499999672174454,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.051500000059604645,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/homomorphism","display_name":"Homomorphism","score":0.6251000165939331},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5202000141143799},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5060999989509583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45399999618530273},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.43779999017715454},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.43290001153945923},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4253000020980835},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3614000082015991}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.661899983882904},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.6251000165939331},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5202000141143799},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5109000205993652},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5060999989509583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45399999618530273},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.43290001153945923},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4253000020980835},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4032999873161316},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35899999737739563},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3587999939918518},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3197999894618988},{"id":"https://openalex.org/C13200473","wikidata":"https://www.wikidata.org/wiki/Q2747831","display_name":"Reflexivity","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.3028999865055084},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.27799999713897705},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.2669000029563904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25839999318122864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2556999921798706},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.09576","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.09576","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.09576","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.09576","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,68],"present":[1,103],"a":[2,49,104],"structural":[3,22],"classification":[4,19,35,108],"of":[5,48,77,88,96,109],"constraint":[6],"satisfaction":[7],"problems":[8,27,80,111],"(CSP)":[9],"described":[10],"by":[11],"reflexive":[12,50],"complete":[13,51],"$2$-edge-coloured":[14,52,62],"graphs.":[15],"In":[16],"particular,":[17],"this":[18,64],"extends":[20],"the":[21,30,46,75,89],"dichotomy":[23],"for":[24,60,112],"graph":[25,53],"homomorphism":[26],"known":[28],"as":[29],"Hell--Ne\u0161et\u0159il":[31],"theorem":[32],"(1990).":[33],"Our":[34],"is":[36,54,66],"also":[37],"efficient:":[38],"we":[39,85,102],"can":[40],"check":[41],"in":[42,55,74],"polynomial":[43],"time":[44],"whether":[45],"CSP":[47],"P":[56,105],"or":[57],"NP-complete,":[58],"whereas":[59],"arbitrary":[61],"graphs,":[63],"task":[65],"NP-complete.":[67],"then":[69],"apply":[70],"our":[71],"main":[72],"result":[73],"context":[76],"matrix":[78,97,113],"partition":[79,98],"and":[81],"sandwich":[82,110],"problems.":[83,99],"Firstly,":[84],"obtain":[86],"one":[87],"few":[90],"algorithmic":[91],"solutions":[92],"to":[93],"general":[94],"classes":[95],"And":[100],"secondly,":[101],"vs.":[106],"NP-complete":[107],"partitions.":[114]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-12T00:00:00"}