{"id":"W2407347952","doi":"","title":"Compression of Boolean Functions.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Boolean function; Boolean circuit; Circuit complexity; Implicant; Circuit minimization for Boolean functions; Discrete mathematics; Binary decision diagram; Mathematics; Monotone polygon; Branching (polymer chemistry); Quadratic equation; Combinatorics; Function (biology); Electronic circuit; Algorithm; Boolean expression","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.001551487,0.00102008,0.001098244,0.00127094,0.0009329222,0.002290345,0.001605995,0.001401263,0.009215969],"category_scores_gemma":[0.01209465,0.0005183064,0.001182416,0.001770209,0.002229208,0.006898165,0.002324831,0.002643332,0.001408546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002275318,"about_ca_system_score_gemma":0.0009229023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008190111,"about_ca_topic_score_gemma":0.0007122002,"domain_scores_codex":[0.9976352,0.0004682361,0.0001254465,0.000630624,0.0008717999,0.0002685415],"domain_scores_gemma":[0.991487,0.005291696,0.0004269355,0.002177013,0.0004249167,0.0001924217],"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.001367643,0.0003271568,0.003882888,0.0009730577,0.0001607366,0.0005678319,0.0005814562,0.1071702,0.03145233,0.4887547,0.01074732,0.3540147],"study_design_scores_gemma":[0.0001086861,0.000427968,0.001405281,0.0001272229,0.00008794621,0.001028839,0.0001812677,0.3685214,0.04342445,0.5621392,0.02249969,0.00004809716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2148413,0.004741146,0.721305,0.004550606,0.0004710924,0.0005090557,0.00136902,0.004406037,0.04780674],"genre_scores_gemma":[0.8104541,0.001829636,0.170719,0.001034934,0.0005080858,0.0004554821,0.00252833,0.0005463192,0.01192406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009215969,"threshold_uncertainty_score":0.0308305,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01212308748978913,"score_gpt":0.2079682523820154,"score_spread":0.1958451648922263,"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."}}