Improving 3N Circuit Complexity Lower Bounds
COMPUTATIONAL COMPLEXITY（2023）
关键词
Boolean circuits,lower bounds,dispersers,68Q17 Computational difficulty of problems (lower bounds,completeness,difficulty of approximation,etc.)
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要