{"id":"W2952920300","doi":"10.1145/3013516","title":"Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"National Science Foundation","keywords":"Nondeterministic algorithm; Upper and lower bounds; Sublinear function; Branching (polymer chemistry); Computation; Boolean function","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.0005919316,0.0001337218,0.0001523156,0.0002277191,0.0001944856,0.00006466138,0.0003934183,0.00006776708,0.00005567747],"category_scores_gemma":[0.00002547997,0.0001061567,0.00007728391,0.0002115788,0.00008543737,0.0008812,0.00001549498,0.00009185685,0.000009681668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168078,"about_ca_system_score_gemma":0.00003774272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008862082,"about_ca_topic_score_gemma":0.000006507683,"domain_scores_codex":[0.998873,0.0001433797,0.0002922353,0.0003279086,0.0002105385,0.0001529157],"domain_scores_gemma":[0.9982021,0.0009949587,0.000131254,0.0004927993,0.00009768893,0.00008115031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003776724,0.0001343848,0.000006244747,0.00000920945,0.00002117682,0.000001949401,0.0004559146,0.001266249,0.00172804,0.06569683,0.000003775475,0.9306385],"study_design_scores_gemma":[0.0008648668,0.0004771732,0.005645551,0.00005673048,0.00002074404,0.0000230167,0.00005357571,0.05374703,0.010461,0.9282351,0.0001623681,0.0002527984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03834011,0.00001476601,0.9604437,0.0003656574,0.0003428026,0.0001300058,0.00001202686,0.0001147454,0.0002361831],"genre_scores_gemma":[0.780521,0.000008279434,0.2192585,0.0001022709,0.00002150741,0.00000710998,0.000001512054,0.000008108087,0.0000716896],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9303856,"threshold_uncertainty_score":0.4328946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03216755379160711,"score_gpt":0.3231520444204931,"score_spread":0.290984490628886,"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."}}