{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00354856,0.001030646,0.001674662,0.001349732,0.002085541,0.005467989,0.002824795,0.002000906,0.01004073],"category_scores_gemma":[0.0294599,0.0006262222,0.001706822,0.002280475,0.005655565,0.01547561,0.005807863,0.005531825,0.0008922198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003726468,"about_ca_system_score_gemma":0.001815049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002934729,"about_ca_topic_score_gemma":0.001787024,"domain_scores_codex":[0.9959466,0.001402557,0.0001905146,0.0006986395,0.001044008,0.0007176629],"domain_scores_gemma":[0.9697638,0.02598774,0.0007592727,0.002360201,0.0006411326,0.0004878082],"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.0004447913,0.0001082288,0.001360769,0.0002841752,0.00004298275,0.0001278054,0.0003865983,0.11329,0.002136128,0.8549935,0.003253048,0.02357183],"study_design_scores_gemma":[0.00004344982,0.00003487464,0.0004418672,0.00003251003,0.00002411953,0.00005606055,0.00009255505,0.2407746,0.001192276,0.7557483,0.00153643,0.00002295092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4216048,0.002394668,0.5030166,0.01058521,0.0002175846,0.0002053363,0.0009350735,0.0009411976,0.06009954],"genre_scores_gemma":[0.9030901,0.001324669,0.0858615,0.0004842093,0.0003327579,0.0003188729,0.0008858705,0.0003408793,0.007360979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01004073,"threshold_uncertainty_score":0.0335896,"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."}}