{"id":"W2157381209","doi":"10.1109/ccc.2011.15","title":"Approximation Algorithms for QMA-Complete Problems","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Approximation algorithm; Constraint satisfaction problem; Polynomial-time approximation scheme; Approximation theory; Class (philosophy); Computer science; Hamiltonian (control theory); Algorithm; Mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence","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.003737476,0.001267864,0.001811824,0.001264064,0.001187171,0.003029025,0.0039331,0.002240474,0.006293447],"category_scores_gemma":[0.0184198,0.0006918863,0.001688897,0.002564307,0.00204435,0.005433541,0.003225793,0.004563785,0.001156984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003040841,"about_ca_system_score_gemma":0.002208822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002929743,"about_ca_topic_score_gemma":0.004361593,"domain_scores_codex":[0.9961246,0.001571309,0.000175578,0.0006970449,0.0009131302,0.000518334],"domain_scores_gemma":[0.987824,0.009106641,0.0004172402,0.001757528,0.0005367981,0.0003579372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004215528,0.0003153023,0.001212372,0.0005181569,0.0001752304,0.00008459655,0.00039474,0.4351009,0.001861069,0.4251098,0.01054344,0.1242628],"study_design_scores_gemma":[0.00005408949,0.00002709117,0.0001135574,0.0000195702,0.00001703637,0.00003781201,0.00004171433,0.7614942,0.0004872523,0.2362193,0.001480383,0.000008088219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01845476,0.001036388,0.972713,0.00114362,0.00008288186,0.0001049026,0.0002501381,0.0008257011,0.005388614],"genre_scores_gemma":[0.427661,0.001129201,0.5617067,0.0006227685,0.0003110497,0.0005609161,0.00159942,0.0005417942,0.005867195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006293447,"threshold_uncertainty_score":0.0220629,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1384565972042934,"score_gpt":0.2649026646200964,"score_spread":0.126446067415803,"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."}}