{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001292473,0.001058848,0.001111259,0.001214109,0.0006748687,0.001458138,0.005281017,0.0005483547,0.00009553285],"category_scores_gemma":[0.0002821425,0.0008765223,0.0001597729,0.001815637,0.001633754,0.001645092,0.001289234,0.001925675,0.0000593061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005651606,"about_ca_system_score_gemma":0.001092549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003335622,"about_ca_topic_score_gemma":0.000160946,"domain_scores_codex":[0.992184,0.0001187356,0.0007550239,0.002862732,0.002111727,0.001967811],"domain_scores_gemma":[0.9938618,0.001576638,0.0005625428,0.002956231,0.0005731172,0.0004696487],"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.0003392076,0.0005227958,0.002376822,0.0005535218,0.0002210782,0.001213497,0.00171729,0.08034001,0.002288758,0.5567125,0.0003523858,0.3533621],"study_design_scores_gemma":[0.001111618,0.0009101375,0.0002749829,0.0009797692,0.0000241605,0.0003493788,9.586668e-7,0.1844115,0.004753999,0.8002211,0.005044615,0.001917735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007752796,0.0004511059,0.9909813,0.0003857072,0.000779784,0.0008768023,0.00001720809,0.0002427925,0.005490001],"genre_scores_gemma":[0.04837172,0.00005008453,0.9447984,0.002084769,0.0001904023,0.00006574945,0.000008488289,0.0001184583,0.004311966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3514444,"threshold_uncertainty_score":0.9995784,"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."}}