{"id":"W1971650774","doi":"10.1137/s0097539702415950","title":"Counting Complexity Classes for Numeric Computations I: Semilinear Sets","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Betti number; Complexity class; Completeness (order theory); Computation; Mathematics; Class (philosophy); Discrete mathematics; Characterization (materials science); Counting problem; Euler's formula; Euler characteristic; Combinatorics; Model of computation; Transfer (computing); Computational complexity theory; Time complexity; Algorithm; Computer science; Physics; Mathematical analysis","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.0009790722,0.0007369586,0.0007124137,0.002491046,0.001424333,0.00525387,0.001642301,0.0009561085,0.005935541],"category_scores_gemma":[0.005141343,0.000373401,0.001475703,0.002871377,0.003553855,0.008290591,0.002481361,0.00346055,0.0005638263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004729273,"about_ca_system_score_gemma":0.0009563294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0010256,"about_ca_topic_score_gemma":0.0007942099,"domain_scores_codex":[0.9984238,0.0001959402,0.0001106787,0.0003615273,0.0006333642,0.0002747793],"domain_scores_gemma":[0.9948387,0.002538666,0.0006936411,0.0009806276,0.0005423116,0.0004060298],"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.00003839201,0.00003520295,0.0007988144,0.00005931471,0.000007775138,0.00002379512,0.0001778716,0.004128172,0.001161387,0.9831215,0.0008309089,0.009616951],"study_design_scores_gemma":[0.00001173197,0.00002573721,0.0008948093,0.00002465584,0.00001360548,0.00009860138,0.0000949296,0.0530652,0.003837056,0.937092,0.004817506,0.00002411443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4190437,0.001025143,0.5236399,0.002139302,0.0001265942,0.000184068,0.0009988266,0.0005700539,0.05227245],"genre_scores_gemma":[0.9305844,0.0003581787,0.05964604,0.0002485783,0.0002245637,0.000258665,0.0007468959,0.00009926983,0.007833388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005935541,"threshold_uncertainty_score":0.03431344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0597100730862779,"score_gpt":0.3185660829249645,"score_spread":0.2588560098386866,"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."}}