{"id":"W2126546664","doi":"10.1109/ccc.2006.27","title":"Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean function; Truth table; Reduction (mathematics); Mathematics; Combinatorics; Discrete mathematics; Function (biology); Circuit minimization for Boolean functions; Parity function; Boolean circuit; Binary logarithm; Boolean expression; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000789149,0.0009771219,0.0007212128,0.0006880393,0.0006115576,0.001730393,0.001881909,0.001144547,0.007727878],"category_scores_gemma":[0.00722068,0.0006648803,0.001089752,0.001510545,0.000999734,0.003310124,0.001381231,0.001672112,0.0004963124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003408427,"about_ca_system_score_gemma":0.001223619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006337309,"about_ca_topic_score_gemma":0.008539348,"domain_scores_codex":[0.998818,0.000240645,0.0000740774,0.0003608442,0.0003031435,0.0002033083],"domain_scores_gemma":[0.9949941,0.003902942,0.0002901833,0.0003520355,0.0002891749,0.0001716684],"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.0006878728,0.0002675783,0.003955432,0.00119813,0.000150864,0.0004113052,0.0003667925,0.3577322,0.009297061,0.3984555,0.02419276,0.2032845],"study_design_scores_gemma":[0.0001362912,0.0001302726,0.001602799,0.00007378055,0.00008819644,0.0003718241,0.0001893132,0.5626311,0.00666863,0.4130048,0.01507163,0.00003132863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3232912,0.002759726,0.5926588,0.006822348,0.0002216164,0.0004806818,0.004476221,0.002130229,0.06715927],"genre_scores_gemma":[0.6454161,0.001291216,0.3288695,0.001046149,0.0002028773,0.0003560651,0.003341178,0.0003641726,0.01911283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007727878,"threshold_uncertainty_score":0.02585238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01443841355999156,"score_gpt":0.2125344746737917,"score_spread":0.1980960611138002,"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."}}