{"id":"W6999413970","doi":"","title":"The constraint satisfaction problem: complexity and approximability","year":2017,"lang":"en","type":"book","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Dresden; Grantová Agentura České Republiky","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint (computer-aided design); Hybrid algorithm (constraint satisfaction); Computational complexity theory; Approximation algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001417514,0.001561432,0.001607398,0.001568048,0.0009247133,0.006024224,0.002118278,0.001658184,0.01607403],"category_scores_gemma":[0.008756564,0.001199992,0.001557054,0.006105297,0.0035174,0.008462407,0.002055231,0.006472968,0.003717508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003104305,"about_ca_system_score_gemma":0.002543581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003953349,"about_ca_topic_score_gemma":0.003345641,"domain_scores_codex":[0.9982293,0.0003122658,0.0000980408,0.0002827292,0.0009904198,0.00008727735],"domain_scores_gemma":[0.9957439,0.003228809,0.0001316753,0.000436918,0.0003843496,0.00007429834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004607477,0.00005748054,0.0002060441,0.0009884256,0.00004641551,0.00006003497,0.0002275103,0.02101431,0.0004674407,0.6709136,0.08518592,0.2207866],"study_design_scores_gemma":[0.00001564544,0.000011394,0.0001737869,0.0002261776,0.00001843906,0.0001370262,0.00006724098,0.02506177,0.0003180172,0.8854507,0.08850136,0.00001853621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007611971,0.0904597,0.6131728,0.01562715,0.00238837,0.0001629119,0.001392137,0.0007670787,0.2684178],"genre_scores_gemma":[0.1588948,0.1190557,0.5618671,0.002878941,0.006285696,0.0006869496,0.00517343,0.001363698,0.1437937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01607403,"threshold_uncertainty_score":0.05377299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04102692681197964,"score_gpt":0.25888046554094,"score_spread":0.2178535387289604,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}