Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs.

Stephen A. Cook,Jeff Edmonds,Venkatesh Medabalimi,Toniann Pitassi

ICALP（2016）

引用 22|浏览39

暂无评分

摘要

We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching programs. Prior to our result the best that was known was for D-ary branching programs with |D| u003e= 2^{13}.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要