{"id":"W1944379106","doi":"10.1137/120895950","title":"Space Complexity in Polynomial Calculus","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Vetenskapsrådet; Kungliga Tekniska Högskolan; Akademie Věd České Republiky; Univerzita Karlova v Praze; Grantová Agentura České Republiky; European Commission","keywords":"Pigeonhole principle; Mathematics; Proof complexity; Polynomial; Space (punctuation); Mathematical proof; Calculus (dental); Upper and lower bounds; Linear space; PSPACE; Discrete mathematics; Resolution (logic); Combinatorics; Computational complexity theory; Geometry; Mathematical analysis; Algorithm; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.004116582,0.001471601,0.00176562,0.00256935,0.003221375,0.007658117,0.00375454,0.002046124,0.01821668],"category_scores_gemma":[0.028257,0.0009585388,0.004355104,0.003340796,0.006491833,0.02184156,0.008527018,0.01116402,0.002280165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006206783,"about_ca_system_score_gemma":0.00311206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004269661,"about_ca_topic_score_gemma":0.003117236,"domain_scores_codex":[0.9873325,0.002389636,0.0006399046,0.002668917,0.004733777,0.002235312],"domain_scores_gemma":[0.9532098,0.0369413,0.001458735,0.004659473,0.002644832,0.001085866],"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.0001622682,0.00006229991,0.0009331152,0.0004133343,0.00006558342,0.0001357002,0.0006916807,0.009641955,0.001985863,0.9583592,0.007244242,0.0203048],"study_design_scores_gemma":[0.00003401198,0.0000369742,0.0004632821,0.00005076846,0.00005999869,0.0001314664,0.00008427445,0.03049352,0.001520352,0.9564933,0.01060455,0.00002750487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1465148,0.008963033,0.676444,0.01926684,0.0008420949,0.0003647553,0.002493935,0.002726265,0.1423843],"genre_scores_gemma":[0.8182555,0.004917121,0.1452169,0.003187191,0.001950743,0.0006399446,0.002013058,0.00136448,0.02245508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01821668,"threshold_uncertainty_score":0.0609408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1428878891099822,"score_gpt":0.3584239022031194,"score_spread":0.2155360130931371,"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."}}