{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"","keywords":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008463288,0.005100482,0.004312089,0.006398665,0.003784882,0.01144963,0.01060217,0.006134367,0.02146068],"category_scores_gemma":[0.07139127,0.00309061,0.004055646,0.008619263,0.007417938,0.03470306,0.01263131,0.02305036,0.004190336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01150192,"about_ca_system_score_gemma":0.004520395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004932929,"about_ca_topic_score_gemma":0.006004489,"domain_scores_codex":[0.9867776,0.003082916,0.0003789829,0.002254298,0.004817618,0.002688527],"domain_scores_gemma":[0.8607691,0.1192807,0.002502595,0.009900911,0.004646876,0.0028999],"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.0008967411,0.0004372341,0.001423188,0.0008922399,0.0001181757,0.0001473004,0.0008099985,0.08635771,0.004366122,0.805893,0.03386221,0.06479615],"study_design_scores_gemma":[0.0000688101,0.00005442481,0.0004862315,0.0001694926,0.00009391575,0.00008480496,0.0001041414,0.1513087,0.002208234,0.8360214,0.009360155,0.00003964859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07169758,0.01474687,0.7164593,0.03154431,0.001687115,0.0004046058,0.002319894,0.002563023,0.1585773],"genre_scores_gemma":[0.621447,0.01932631,0.2605947,0.01202016,0.008723834,0.002366564,0.003808189,0.005461532,0.0662518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02146068,"threshold_uncertainty_score":0.0834527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1246287817561772,"score_gpt":0.3159649090989075,"score_spread":0.1913361273427303,"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."}}