{"id":"W2982393288","doi":"10.4230/lipics.ccc.2020.12","title":"Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Invariant (physics); Invariant theory; Conjecture; Mathematics; Computational complexity theory; Algebraic number; Proof complexity; Polynomial ring; Algebra over a field; Discrete mathematics; Theoretical computer science; Polynomial; Pure mathematics; Computer science; Algorithm; Mathematical proof","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.00289355,0.0006654076,0.001114701,0.001589102,0.002066539,0.005819764,0.002479142,0.002086339,0.01020188],"category_scores_gemma":[0.0213255,0.0005437497,0.001828382,0.003031928,0.005018842,0.0163773,0.003306379,0.005113472,0.0008225545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003857675,"about_ca_system_score_gemma":0.002463715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002264733,"about_ca_topic_score_gemma":0.002455905,"domain_scores_codex":[0.9971831,0.0009576672,0.0001790074,0.0006943838,0.0005953693,0.0003905927],"domain_scores_gemma":[0.9732249,0.02299411,0.001081828,0.001716403,0.0005591146,0.0004235765],"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.0002741053,0.0001910458,0.002379211,0.0005554348,0.00006248585,0.0002791233,0.0007806577,0.04449818,0.001861273,0.8785471,0.009143741,0.06142777],"study_design_scores_gemma":[0.00004747054,0.00003810922,0.0003232701,0.00003237456,0.00003268638,0.0001510604,0.0002762303,0.05369622,0.002235891,0.9401904,0.002952593,0.00002367955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3962992,0.002499722,0.5376399,0.02598729,0.0002414603,0.000425948,0.003070629,0.001535948,0.03229981],"genre_scores_gemma":[0.8553589,0.001349663,0.1309807,0.001163115,0.0004248836,0.0002846219,0.002450036,0.000329681,0.00765835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01020188,"threshold_uncertainty_score":0.03412867,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06788203052079886,"score_gpt":0.2681875824002677,"score_spread":0.2003055518794688,"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."}}