{"id":"W1493350325","doi":"10.1007/3-540-45071-8_55","title":"Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parameterized complexity; Bounded function; Variable (mathematics); Computer science; Computational complexity theory; Time complexity; Satisfiability; Tree (set theory); Discrete mathematics; Combinatorics; Algorithm; 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.001566247,0.001253008,0.002226877,0.001315754,0.00146542,0.00551333,0.00512328,0.002151784,0.01005872],"category_scores_gemma":[0.01330257,0.001775321,0.002518695,0.003508263,0.003088238,0.0122942,0.002972888,0.01001112,0.001112357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004223775,"about_ca_system_score_gemma":0.002222025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003634468,"about_ca_topic_score_gemma":0.005739948,"domain_scores_codex":[0.9975381,0.0004540195,0.0001456858,0.0005629643,0.0008932279,0.0004060713],"domain_scores_gemma":[0.9905743,0.007242611,0.0005056239,0.001026772,0.0004880657,0.0001626618],"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.0006166102,0.0002771534,0.001084409,0.0006210419,0.0001611176,0.0004257469,0.0006940653,0.05089976,0.006472652,0.8462518,0.01283673,0.07965905],"study_design_scores_gemma":[0.00012182,0.00001908863,0.0002182954,0.00004017987,0.00009618787,0.0001300819,0.00009652798,0.05324422,0.002870973,0.9400981,0.003043371,0.00002115191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1781872,0.002201576,0.7147774,0.00650832,0.0002076999,0.0003591512,0.002553978,0.003941424,0.09126326],"genre_scores_gemma":[0.8165449,0.00113232,0.1559689,0.0008864933,0.0002430857,0.0004398122,0.003539061,0.001162397,0.02008312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01005872,"threshold_uncertainty_score":0.0336498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01988659909971994,"score_gpt":0.2557796876138571,"score_spread":0.2358930885141371,"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."}}