{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001413798,0.0001218946,0.00014357,0.00009959428,0.0002041403,0.0002510901,0.0004458343,0.00004375547,0.00003743437],"category_scores_gemma":[0.00001555571,0.0001105343,0.0000444064,0.0003669202,0.00005053095,0.0005271462,0.0002667036,0.00008542725,0.0000184494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001527709,"about_ca_system_score_gemma":0.00002755894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001600716,"about_ca_topic_score_gemma":0.00002998718,"domain_scores_codex":[0.998972,0.00001996066,0.0001698151,0.0003438475,0.0001811419,0.0003132591],"domain_scores_gemma":[0.9994028,0.000119964,0.00004347618,0.000323977,0.0000402894,0.00006945761],"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.000002238656,0.0001147403,0.001468364,0.00003297841,0.00001804844,0.00003179676,0.000408532,0.00005266328,0.0008555704,0.8504036,0.005975204,0.1406363],"study_design_scores_gemma":[0.002258291,0.0002942127,0.03436066,0.00009878923,0.00002331188,0.0002360697,0.000217462,0.3482207,0.01261769,0.5090308,0.09139589,0.00124612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05219839,0.0004462819,0.8570651,0.0009518475,0.0005095541,0.0002050615,0.000006939765,0.0004445743,0.08817226],"genre_scores_gemma":[0.9168366,0.0000100031,0.08099251,0.0002451436,0.0001191488,0.000008981703,0.000002838258,0.000008009336,0.00177678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8646382,"threshold_uncertainty_score":0.4507456,"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."}}