{"id":"W2577580961","doi":"10.1142/s0129054112400023","title":"ON THE COMPLEXITY OF THE EVALUATION OF TRANSIENT EXTENSIONS OF BOOLEAN FUNCTIONS","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Boolean function; Computer science; And-inverter graph; Boolean circuit; Product term; Transient (computer programming); Boolean expression; Mathematics; Theoretical computer science; Calculus (dental); Algorithm; Two-element Boolean algebra; Algebra over a field; Programming language; Medicine; Pure mathematics","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.005062505,0.001139735,0.001742195,0.001197461,0.001599502,0.005358773,0.002846869,0.001593803,0.006008774],"category_scores_gemma":[0.03693616,0.000804402,0.002351042,0.002384722,0.002678776,0.01333505,0.003164201,0.003047393,0.0006311638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003205412,"about_ca_system_score_gemma":0.003044439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005072056,"about_ca_topic_score_gemma":0.005033211,"domain_scores_codex":[0.9920129,0.002685877,0.000703889,0.001212837,0.002233141,0.001151335],"domain_scores_gemma":[0.9133024,0.07733281,0.002500318,0.003972124,0.002075371,0.0008171102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005285994,0.0007595904,0.01911154,0.001649772,0.0005126326,0.001614301,0.002254507,0.48316,0.02305288,0.1679616,0.01031809,0.2843191],"study_design_scores_gemma":[0.0001965877,0.0001797823,0.001557573,0.00005781348,0.0001639628,0.0003163361,0.000253977,0.7850527,0.007620871,0.2029607,0.001581828,0.00005785027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6117142,0.001264283,0.3664832,0.00366188,0.0001119528,0.0003714608,0.001186099,0.002410701,0.01279637],"genre_scores_gemma":[0.8801056,0.0005641892,0.1136694,0.0004170907,0.000148033,0.0002600489,0.00115576,0.000394095,0.003285782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006008774,"threshold_uncertainty_score":0.02677339,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1291512989180462,"score_gpt":0.3521225510733017,"score_spread":0.2229712521552555,"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."}}