{"id":"W7133054918","doi":"","title":"Some algorithmic and complexity results for monotone Boolean duality (hypergraph transversal)","year":2004,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"DPLL algorithm; Monotone polygon; Time complexity; True quantified Boolean formula; Conjunctive normal form; Duality (order theory); Boolean function; Polynomial","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002953239,0.0009903422,0.001017093,0.002200769,0.001249229,0.005168194,0.002813308,0.001888544,0.01069647],"category_scores_gemma":[0.01523694,0.001094614,0.002616684,0.003048698,0.00268706,0.01124306,0.003423633,0.007882742,0.001015485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004054646,"about_ca_system_score_gemma":0.002225136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002769805,"about_ca_topic_score_gemma":0.004204046,"domain_scores_codex":[0.9968061,0.0009100823,0.0001507277,0.0007057827,0.0007980385,0.0006292292],"domain_scores_gemma":[0.9803304,0.01507644,0.001367465,0.00152357,0.0009432163,0.0007589523],"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.001064076,0.0008903554,0.006395928,0.001068334,0.0001891901,0.0003781198,0.0008596317,0.05362231,0.01278278,0.7670362,0.01846016,0.137253],"study_design_scores_gemma":[0.0001432154,0.000110781,0.001251183,0.00007097084,0.0001021236,0.0003650086,0.0002060723,0.2203132,0.004859878,0.7663672,0.006166396,0.00004398396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2739905,0.002918539,0.652523,0.01161298,0.0002547973,0.000447516,0.002001633,0.00184734,0.05440375],"genre_scores_gemma":[0.6069148,0.001769174,0.3676863,0.002581716,0.0008013325,0.0005833753,0.002992233,0.0005774791,0.01609364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01069647,"threshold_uncertainty_score":0.03578323,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06680735408382057,"score_gpt":0.3832519155436258,"score_spread":0.3164445614598052,"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."}}