{"id":"W1997489826","doi":"10.4204/eptcs.31.5","title":"On the Complexity of the Evaluation of Transient Extensions of Boolean Functions","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Boolean function; Product term; Boolean circuit; Boolean algebra; Boolean expression; And-inverter graph; Transient (computer programming); Parity function; XOR gate; Circuit minimization for Boolean functions","routes":{"ca_aff":true,"ca_fund":true,"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.006694598,0.001201789,0.001930593,0.001329061,0.001752942,0.006065761,0.003050962,0.001822676,0.006467042],"category_scores_gemma":[0.05064172,0.0009741436,0.002705222,0.002399347,0.003184884,0.01620296,0.003490818,0.003396585,0.0007224139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00366526,"about_ca_system_score_gemma":0.003275778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00500691,"about_ca_topic_score_gemma":0.004725188,"domain_scores_codex":[0.988857,0.00399463,0.0009489192,0.001594515,0.003206231,0.001398726],"domain_scores_gemma":[0.8713781,0.1163346,0.003191811,0.005617627,0.002540218,0.0009376101],"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.00516376,0.0006995944,0.01839449,0.001734204,0.0005134642,0.001635276,0.002416937,0.4665728,0.02186816,0.1956835,0.009437343,0.2758806],"study_design_scores_gemma":[0.0002060948,0.0001713246,0.001590144,0.00007039998,0.0001775287,0.0003465799,0.0002504874,0.7493261,0.008023017,0.2378528,0.001917787,0.00006781096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5495935,0.001367136,0.4258296,0.004249696,0.0001196938,0.0004314271,0.001196652,0.002747463,0.01446492],"genre_scores_gemma":[0.8691049,0.0006634064,0.1236615,0.0004930685,0.0001772149,0.0003252828,0.001166959,0.0005416778,0.003866113],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006694598,"threshold_uncertainty_score":0.03540486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03914086889851467,"score_gpt":0.3038161356205675,"score_spread":0.2646752667220528,"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."}}