{"paper":{"title":"Hybrid VCSPs with crisp and conservative valued templates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rustem Takhanov","submitted_at":"2015-06-22T10:29:46Z","abstract_excerpt":"A constraint satisfaction problem (CSP) is a problem of computing a homomorphism ${\\bf R} \\rightarrow {\\bf \\Gamma}$ between two relational structures. Analyzing its complexity has been a very fruitful research direction, especially for fixed template CSPs, denoted $CSP({\\bf \\Gamma})$, in which the right side structure ${\\bf \\Gamma}$ is fixed and the left side structure ${\\bf R}$ is unconstrained.\n  Recently, the hybrid setting, written $CSP_{\\mathcal{H}}({\\bf \\Gamma})$, where both sides are restricted simultaneously, attracted some attention. It assumes that ${\\bf R}$ is taken from a class of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06540","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}