{"id":"W1568757735","doi":"10.1007/978-3-642-12200-2_32","title":"Finding the Best CAFE Is NP-Hard","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Clique; Binary number; Computer science; Reduction (mathematics); Time complexity; Enhanced Data Rates for GSM Evolution; Computational complexity theory; Polynomial; Hardness of approximation; Theoretical computer science; Discrete mathematics; Combinatorics; Algorithm; Approximation algorithm; Mathematics; Arithmetic; Artificial intelligence","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.001135371,0.001598439,0.002615243,0.001235568,0.003123313,0.004312057,0.002146226,0.003525579,0.0292227],"category_scores_gemma":[0.008008618,0.001711909,0.002644218,0.002539409,0.002481234,0.01465689,0.002486376,0.005129152,0.005222728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001739653,"about_ca_system_score_gemma":0.001665536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003308576,"about_ca_topic_score_gemma":0.006390597,"domain_scores_codex":[0.9984458,0.0002495249,0.00009615226,0.0005768618,0.0003177439,0.000313827],"domain_scores_gemma":[0.9929046,0.004829609,0.0003125879,0.001178327,0.0005229692,0.0002518994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009288542,0.0006383796,0.003093811,0.002313204,0.0002755548,0.0006356777,0.0007449538,0.033836,0.009761241,0.3119076,0.1873458,0.4485189],"study_design_scores_gemma":[0.00030044,0.0001632386,0.0009123042,0.0003089744,0.000257547,0.001108737,0.0006588283,0.06499899,0.007851515,0.8402494,0.08310343,0.00008658195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979872,0.006891035,0.548848,0.02293967,0.001004292,0.0005156471,0.006525876,0.01270103,0.2025872],"genre_scores_gemma":[0.4254665,0.002197048,0.5153093,0.001298106,0.0003775615,0.000259918,0.003759247,0.002672658,0.04865959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0292227,"threshold_uncertainty_score":0.09775966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03334229128567038,"score_gpt":0.2729033384576659,"score_spread":0.2395610471719955,"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."}}