{"id":"W1558213091","doi":"10.1007/978-3-540-79719-7_10","title":"Complexity and Algorithms for Well-Structured k-SAT Instances","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Constructive; Discrete mathematics; Path (computing); Computational complexity theory; Algorithm; Graph; Pathwidth; Computer science; Line graph","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.00291487,0.001743723,0.001951187,0.002133886,0.001937578,0.01054658,0.004942967,0.003233666,0.01892907],"category_scores_gemma":[0.01875247,0.002084774,0.004030952,0.00551813,0.003331217,0.02074933,0.00456831,0.009623426,0.003420498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004377462,"about_ca_system_score_gemma":0.002960534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001993005,"about_ca_topic_score_gemma":0.003330708,"domain_scores_codex":[0.9957216,0.00128055,0.0003176902,0.0009988266,0.001176191,0.0005051538],"domain_scores_gemma":[0.9767825,0.01854349,0.0009329696,0.002408101,0.000828494,0.000504454],"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.0007572527,0.0004985314,0.002435924,0.00140058,0.0002344806,0.0002075826,0.0008144164,0.09316777,0.003867261,0.7263262,0.03520554,0.1350846],"study_design_scores_gemma":[0.00008527764,0.00003099839,0.0003792533,0.00005316889,0.00005625997,0.0001447076,0.0001078761,0.1093656,0.0008683533,0.8857652,0.003113828,0.00002948353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1206295,0.006157065,0.7724922,0.01363011,0.0006220455,0.0005631462,0.004662638,0.002291592,0.07895171],"genre_scores_gemma":[0.4905348,0.004559774,0.4603038,0.001572239,0.001650126,0.001263492,0.009613578,0.00128682,0.02921535],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01892907,"threshold_uncertainty_score":0.06332403,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04733726490897559,"score_gpt":0.3021002439137633,"score_spread":0.2547629790047877,"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."}}