{"id":"W326289323","doi":"10.1007/978-3-642-02017-9_29","title":"Kolmogorov Complexity and Combinatorial Methods in Communication Complexity","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Kolmogorov complexity; Communication complexity; Kolmogorov structure function; Minimax; Mathematics; Upper and lower bounds; Worst-case complexity; Quantum complexity theory; Mutual information; Intuition; Computational complexity theory; Dimension (graph theory); Discrete mathematics; Matching (statistics); Kolmogorov equations (Markov jump process); Theoretical computer science; Computer science; Quantum; Combinatorics; Time complexity; Algorithm; Mathematical optimization; Quantum information; Statistics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002918326,0.0003148731,0.0004682803,0.000662566,0.0004840658,0.0005872259,0.003185884,0.0001244843,0.000006416858],"category_scores_gemma":[0.0002394637,0.0003120428,0.00006668412,0.003338464,0.001589217,0.001113405,0.001281257,0.0007052406,0.000003687832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001792034,"about_ca_system_score_gemma":0.0001531034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000260458,"about_ca_topic_score_gemma":0.000295329,"domain_scores_codex":[0.9965954,0.0005414661,0.0005473176,0.001041422,0.0005587488,0.0007156306],"domain_scores_gemma":[0.9972662,0.0008013507,0.0001575513,0.001446703,0.0001427953,0.0001853902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001198777,0.000256896,0.002229287,0.00001083797,0.000002772494,0.00001075272,0.001786975,0.00176971,0.0006341304,0.2156275,0.000005672819,0.7776535],"study_design_scores_gemma":[0.0004578351,0.0001138119,0.05457745,0.00004218501,0.000001031016,0.00002630966,0.000001081526,0.4335062,0.00129548,0.5097238,0.00003351233,0.0002213484],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02471915,0.0003180947,0.9693558,0.003980334,0.0009851608,0.0003150636,0.000001703798,0.0001647019,0.0001599412],"genre_scores_gemma":[0.4933744,0.00001586181,0.5059085,0.0006461368,0.00004637735,0.000003671519,0.000001477898,0.000003367838,1.538558e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7774322,"threshold_uncertainty_score":0.9999332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04707098481877801,"score_gpt":0.3411465336750322,"score_spread":0.2940755488562541,"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."}}