{"id":"W2083633130","doi":"10.1007/s00037-013-0065-9","title":"Parallel Approximation of Min-Max Problems","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Multiplicative function; Mathematical proof; Mathematics; Class (philosophy); Matrix (chemical analysis); Complexity class; Discrete mathematics; Combinatorics; Computational complexity theory; Time complexity; Computer science; Algorithm","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.0002042887,0.0001609015,0.0002259045,0.0001210982,0.0001589911,0.0001161981,0.0007241933,0.00004500759,0.000044447],"category_scores_gemma":[0.00003235518,0.0001458413,0.00009375947,0.0003860697,0.000145807,0.000310588,0.0002727576,0.0001472663,0.00009848872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002348434,"about_ca_system_score_gemma":0.00006852593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001001222,"about_ca_topic_score_gemma":0.000002538481,"domain_scores_codex":[0.9984828,0.00009475435,0.0004009547,0.0003541211,0.0004254828,0.0002418504],"domain_scores_gemma":[0.9988473,0.0001877445,0.0002176901,0.0003301625,0.0003233411,0.00009373003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002744057,0.0001845782,0.0004937422,0.00008190574,0.00002896071,0.00000121784,0.0007336643,0.7263284,0.0002229221,0.2401704,0.001284276,0.03046723],"study_design_scores_gemma":[0.0001858273,0.00004507127,0.02510706,0.00002054464,0.00000139012,0.00001093483,0.000004223926,0.6333899,0.00003675318,0.3409672,0.000124024,0.0001070683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1362979,0.00006749187,0.860675,0.00116833,0.0001476523,0.0003224495,0.000004521904,0.0001632294,0.001153479],"genre_scores_gemma":[0.573792,4.456655e-7,0.4259753,0.0001246922,0.0000399133,0.00001511313,0.00002017335,0.000005551542,0.00002675486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4374942,"threshold_uncertainty_score":0.5947233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03443949735732771,"score_gpt":0.2506904739364064,"score_spread":0.2162509765790787,"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."}}