首页> 外文OA文献 >A Lower Bound Technique for nondeterministic graph-driven readonce branching programs and its applications

【2h】

A Lower Bound Technique for nondeterministic graph-driven readonce branching programs and its applications

机译：非确定性图驱动的readonce分支程序的下界技术及其应用

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Beate Bollig;
展开▼
作者单位

展开▼
年度 2002
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications [J] . Bollig B, Woelfel P Theory of computing systems . 2005,第6期

机译：非确定性图驱动的一次读取分支程序的下限技术及其应用
2. Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication [J] . Beate Bollig, Stephan Waack, Philipp Woelfel Theoretical computer science . 2006,第1a3期

机译：奇偶校验图驱动的一次读取分支程序和整数乘法的指数下限
3. Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication [J] . Beate Bollig, Philipp Woelfel, Stephan Waack Electronic Colloquium on Computational Complexity . 2001,第1期

机译：奇偶校验图驱动的读取程序和整数乘法的指数下限
4. A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications [C] . Beate Bollig, Philipp Woelfel International symposium on mathematical foundtions of computer science . 2002

机译：用于非匹配图形驱动的读取次分支程序及其应用的下限技术
5. Branching Program Lower Bounds [D] . Medabalimi, Venkatesh. 2018

机译：分支程序下界
6. Efficient branch-and-bound techniques for two-locus association mapping [O] . Karin Klotzbücher, Yasushi Kobayashi, Nino Shervashidze, 2011

机译：用于两位置关联映射的高效分支定界技术
7. A Lower Bound Technique for nondeterministic graph-driven readonce branching programs and its applications [O] . Beate Bollig 2002

机译：非确定性图驱动readonce分支程序的下界技术及其应用
8. Area-Time Lower-Bound Techniques with Application to Sorting [R] . Bilardi, G., Preparata, F. P. 1985

机译：区域时间下限技术及其在分类中的应用

A Lower Bound Technique for nondeterministic graph-driven readonce branching programs and its applications

著录项

引文网络

相似文献

相关主题

期刊订阅