{"id":"W2565232885","doi":"10.1007/s00037-007-0229-6","title":"The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Concatenation (mathematics); Natural number; Intersection (aeronautics); Computer science; Discrete mathematics; Set (abstract data type); Integer (computer science); Prime (order theory); Electronic circuit; Range (aeronautics); Mathematics; Time complexity; Computational complexity theory; Circuit complexity; Combinatorics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004264606,0.001036588,0.001931927,0.001994393,0.002918572,0.01240244,0.005050345,0.004183616,0.009724434],"category_scores_gemma":[0.04958374,0.001261477,0.002411572,0.003948011,0.006531869,0.02985584,0.003901301,0.00810006,0.0006441029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005823439,"about_ca_system_score_gemma":0.002975903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004259365,"about_ca_topic_score_gemma":0.003997108,"domain_scores_codex":[0.9936686,0.002185607,0.0003400176,0.001303245,0.001732213,0.0007704713],"domain_scores_gemma":[0.9101831,0.08180583,0.00250148,0.00268667,0.001429221,0.001393639],"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.000774178,0.0004750592,0.00624364,0.0008064404,0.0002075729,0.0002111229,0.002045124,0.08516552,0.001412289,0.8407636,0.01268376,0.04921172],"study_design_scores_gemma":[0.00006532836,0.00002259773,0.0007603824,0.00003248842,0.00004458692,0.0001168517,0.0002898247,0.07762633,0.0004985583,0.9188375,0.001678816,0.00002670931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6058076,0.005232973,0.308953,0.03212962,0.0003548075,0.0003761435,0.003479323,0.0007926665,0.04287382],"genre_scores_gemma":[0.9340373,0.002034356,0.04995701,0.0008501622,0.0008531954,0.0003361304,0.002498563,0.0002487169,0.009184564],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01240244,"threshold_uncertainty_score":0.04225218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09899804868414189,"score_gpt":0.3208446374831788,"score_spread":0.2218465887990369,"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."}}