Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity

Irit Dinur; Or Meir

首页> 外文期刊>LIPIcs : Leibniz International Proceedings in Informatics >Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity

【24h】

Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity

机译：朝着KRW成分猜想：通过通信复杂性的三次公式下界

获取原文

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

One of the major challenges of the research in circuit complexity is proving super-polynomial lower bounds for de-Morgan formulas. Karchmer, Raz, and Wigderson suggested to approach this problem by proving that formula complexity behaves "as expected" wit

机译：电路复杂性研究的主要挑战之一是证明de-Morgan公式的超多项式下界。 Karchmer，Raz和Wigderson建议通过证明公式复杂性的行为“符合预期”来解决此问题。

著录项

来源
《LIPIcs : Leibniz International Proceedings in Informatics》 |2016年第2期|共321页
作者
Irit Dinur; Or Meir;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. TOWARD THE KRW COMPOSITION CONJECTURE: CUBIC FORMULA LOWER BOUNDS VIA COMMUNICATION COMPLEXITY [J] . Dinur Irit, Meir Or Computational complexity . 2018,第3期

机译：迈向KRW组合构想：通过通信复杂性实现立体方程式下界
2. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity [J] . Irit Dinur, Or Meir Electronic Colloquium on Computational Complexity . 2016,第136期

机译：朝着KRW成分猜想：通过通信复杂性的三次公式下界
3. Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture [J] . Dmitry Gavinsky, Or Meir, Omri Weinstein, Electronic Colloquium on Computational Complexity . 2013,第126期

机译：走向更好的公式下界：KRW构想猜想的信息复杂性方法
4. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity [C] . Irit Dinur, Or Meir Conference on Computational Complexity . 2016

机译：朝向KRW组成猜测：立方公式通过通信复杂性下限
5. Communication Lower Bounds via Query Complexity. [D] . Goos, Mika. 2016

机译：通过查询复杂度进行通信下界。
6. On an Inequality That Implies the Lower Bound Formula for the Probability of Correct Selection in the Levin-Robbins-Leu Family of Sequential Binomial Subset Selection Procedures [O] . Bruce Levin, Cheng-Shiun Leu -1

机译：关于不等式其隐含着有序二项式子集选择程序的Levin-Robbins-Leu族中正确选择的概率的下界公式
7. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity [O] . Dinur Irit, Meir Or 2016

机译：走向KRW组合猜想：立方公式通过复杂性降低界限
8. The Lower Bound Conjecture for 3- and 4-Manifolds [R] . Walkup, D. W. 1969

机译：3和4流形的下界猜想

Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity

摘要

著录项

相似文献

相关主题

期刊订阅