{"id":"W2066938865","doi":"10.1007/s00037-001-8191-1","title":"Reducing the complexity of reductions","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Gap theorem; Isomorphism (crystallography); Discrete mathematics; Combinatorics; Invertible matrix; Complexity class; Conjecture; Time complexity; Pure mathematics; Fundamental theorem; Crystallography; Crystal structure","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":[],"consensus_categories":[],"category_scores_codex":[0.0005508587,0.0002106155,0.0002892769,0.0001758073,0.000825198,0.0001310541,0.001671474,0.00004943545,0.0001437912],"category_scores_gemma":[0.00008553381,0.0001754585,0.000210052,0.001316482,0.001884089,0.0004119611,0.0005429711,0.0003068327,0.00004158998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005820777,"about_ca_system_score_gemma":0.000146245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002173632,"about_ca_topic_score_gemma":0.00003065833,"domain_scores_codex":[0.9977769,0.0002291984,0.0005490583,0.0004769792,0.0006202038,0.0003476397],"domain_scores_gemma":[0.9980457,0.0003473351,0.0002598381,0.0008286447,0.000406465,0.0001119936],"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.00001049838,0.000170277,0.0002921485,0.00001110436,0.00003970611,0.000004644027,0.0004630199,0.01682755,0.00006453268,0.9732609,0.001546482,0.007309123],"study_design_scores_gemma":[0.0002178139,0.0000477813,0.04048681,0.00001834542,0.000007354667,0.0001618539,0.00004595114,0.2727486,0.00007969372,0.6834071,0.002614847,0.000163769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06498257,0.000183584,0.9142869,0.01114313,0.0008107214,0.0003066926,0.00002858877,0.0002836231,0.00797418],"genre_scores_gemma":[0.8281727,0.000007462148,0.1712435,0.0002787373,0.0001568346,0.0000126152,0.00002632921,0.000009010577,0.00009278915],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7631902,"threshold_uncertainty_score":0.7154991,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1245434252239768,"score_gpt":0.3089948682333011,"score_spread":0.1844514430093243,"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."}}