Lifting Dichotomies

doi:10.1007/s00037-025-00276-5

2025-10-29

Alekseev, Yaroslav *

Yuval Filmus

Alexander Smal

DOI：10.1007/s00037-025-00276-5

原文链接

查看原文

摘要

Keyword:

decision trees

log-rank conjecture

lifting

parity decision trees

information complexity

AI总结

对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Computational Complexity

IF:

论文数:

被引数:

机构

technion israel institute of technology

学者数:

1.8K

论文数: 778

被引数: 0

引用论文

Theory of Computing

IF0

PREAI

Garg,Ankit; Goos,Mika; Kamath,Pritish; Sokolov,Dmitry

The Depth of Resolution Proofs

Studia Logica

IF0

2011-08-31

PREAI

Alasdair Urquhart

Query-to-Communication Lifting for BPP

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)

IF0

2017-10-01

PREAI

Goos,Mika; Pitassi,Toniann; Watson,Thomas

Communication is Bounded by Root of Rank

Journal of the ACM

IF0

2016-03-30

PREAI

Lovett,Shachar

Lattices, mobius functions and communications complexity 格、Möbius函数与通信复杂度

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

IF0

1988-01-01

PREAI

L. Lovasz; M. Saks

IF0

PREAI

Communication Lower Bounds via Critical Block Sensitivity

SIAM Journal on Computing

IF0

2018-01-01

PREAI

Göös,Mika; Pitassi,Toniann

On the virtue of succinct proofs

Proceedings of the forty-fourth annual ACM symposium on Theory of computing

IF0

2012-05-19

PREAI

Huynh,Trinh; Nordstrom,Jakob

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

IF0

2020-11-01

PREAI

de Rezende,Susanna; Meir,Or; Nordstrom,Jakob; Pitassi,Toniann; Robere,Robert; Vinyals,Marc

Complexity measures and decision tree complexity: a survey

Theoretical Computer Science

IF0

2002-10-01

PREAI

Harry Buhrman; Ronald de Wolf

查看更多内容