Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
Author:
Publisher
EDP Sciences
Subject
Computer Science Applications,General Mathematics,Software
Link
http://www.rairo-ita.org/10.1051/ita/1992260605071/pdf
Reference17 articles.
1. [A&86] AJTAI M., BABAJ L., HAJNAL P., KOMLOS J., PUDLAK P., RÖDEL V., SZEMEREDI E. and TURAN G., Two Lower Bounds for Branching Programs, Proc. 18 ACM-STOC, 1986, pp. 30-39.
2. [AM86] ALON N. and MAASS W., Meanders, Ramsey Theory and Lower Bounds for Branching Programs, Proc. 27th ACM-STOC, 1986, pp. 30-39.
3. [CH89] CAI J. and HEMACHANDRA L., On the Power of Parity Polynomial Time, Proc. STACS'89, Springer Verlag, L.N.C.S., No. 349, pp. 229-239.1027404
4. [Co66] COBHAM H., The Recognisation Problem for Perfect Square, Proc. 7-th I.E.E.E. Symp. on SWAT, 1966, pp. 78-87.
5. [DM89] DAMM C. and MEINEL Ch.. Separating Completely Complexity Classes Related to Polynomial Size Ω-Decision Trees, Proc. of FCT'89, L.N.C.S., No. 380, pp. 127-136.10335410756.68039
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication;Theoretical Computer Science;2006-10
2. On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs;Information and Computation;2002-10
3. Parity Graph-Driven Read-Once Branching Programs and An Exponential Lower Bound for Integer Multiplication;Foundations of Information Technology in the Era of Network and Mobile Computing;2002
4. Communication Complexity and BDD Lower Bound Techniques;Numbers, Information and Complexity;2000
5. Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams;Theory of Computing Systems;1999-08-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3