{"id":"W2121804749","doi":"10.2168/lmcs-6(4:4)2010","title":"The complexity of global cardinality constraints","year":2010,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint (computer-aided design); Set (abstract data type); Constraint satisfaction; Mathematics; Time complexity; Complexity of constraint satisfaction; Constraint logic programming; Computational complexity theory; Local consistency; Computer science; Mathematical optimization; Constraint programming; Discrete mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01198497,0.0001513997,0.0002862338,0.0000688396,0.000409297,0.0002285951,0.005312382,0.00007143544,0.000008654303],"category_scores_gemma":[0.001280701,0.00009626892,0.00009771768,0.002738698,0.01591628,0.0004296328,0.002243551,0.0005741765,0.000005117524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006456799,"about_ca_system_score_gemma":0.0002320737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000018388,"about_ca_topic_score_gemma":0.00002290475,"domain_scores_codex":[0.9964453,0.0009347856,0.0004281982,0.0007392059,0.0007681262,0.0006843981],"domain_scores_gemma":[0.9963362,0.001675432,0.0001323548,0.001346695,0.0002924481,0.0002168311],"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.000004015697,0.00002971284,0.002559056,0.000002002197,0.000001376764,0.000004896521,0.00002746908,0.0000495951,0.002669058,0.6078993,0.000001684282,0.3867518],"study_design_scores_gemma":[0.0001404279,0.00009353759,0.09682214,0.000005854637,6.308954e-7,0.00004480919,0.0000048145,0.08293665,0.002900091,0.8168164,0.0001179831,0.0001166414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02893779,0.0000269329,0.9671247,0.0007425809,0.001170739,0.0001952658,0.000002617685,0.00006213118,0.00173723],"genre_scores_gemma":[0.4470786,0.000001320582,0.5528181,0.00007088612,0.00002392914,0.000004799995,3.673961e-8,0.000001152142,0.000001141305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4181408,"threshold_uncertainty_score":0.9871816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1631823224161655,"score_gpt":0.4693948801379104,"score_spread":0.3062125577217448,"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."}}