{"id":"W2092096082","doi":"10.1007/s11512-007-0045-x","title":"On the computational complexity of the Riemann mapping","year":2007,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"DTIME; Time hierarchy theorem; Turing machine; Computational complexity theory; Boundary (topology); Computer science; Mathematics; Domain (mathematical analysis); Riemann hypothesis; Theoretical computer science; Upper and lower bounds; NSPACE; Algorithm; Discrete mathematics; Computation; Pure mathematics; Universal Turing machine; Mathematical analysis","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004868344,0.0004841079,0.0006461476,0.0001567858,0.0007969254,0.0002975952,0.003246865,0.000157144,0.0003306588],"category_scores_gemma":[0.0005385911,0.000293551,0.0004092993,0.001377112,0.001308207,0.0002459529,0.001618156,0.0006055526,0.0003487048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002028155,"about_ca_system_score_gemma":0.0002001468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001359402,"about_ca_topic_score_gemma":0.00005888671,"domain_scores_codex":[0.9945816,0.0008009915,0.00143731,0.0007991383,0.001604046,0.0007768755],"domain_scores_gemma":[0.9925396,0.003835874,0.0009436093,0.002054278,0.0004782561,0.0001484172],"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.00002273146,0.0005123823,0.001321641,0.0005141639,0.0001276071,0.00001457364,0.004950964,0.006750842,0.000129496,0.979823,0.003314082,0.002518505],"study_design_scores_gemma":[0.0004181079,0.0001242851,0.1796413,0.0005366127,0.00002721654,0.00005172825,0.0004595229,0.2568162,0.0005354965,0.5604249,0.00055744,0.0004072267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4080667,0.0003020258,0.5494764,0.01788712,0.003611011,0.002369525,0.00006367444,0.0002357083,0.01798782],"genre_scores_gemma":[0.9700417,0.00000284259,0.02785047,0.001677952,0.0001737551,0.00001350508,0.000004888281,0.00002650994,0.0002083645],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.561975,"threshold_uncertainty_score":0.9999517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06487436475940916,"score_gpt":0.2719687816344178,"score_spread":0.2070944168750087,"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."}}