Lifting Dichotomies

Lifting theorems are used to transfer lower bounds between Boolean function complexity measures. Given a lower bound on a complexity measure A for some function f , we compose f with a carefully chosen gadget function g and get essentially the same lower bound on a complexity measure B for the lifte...

Full description

Saved in:

Bibliographic Details
Published in:	Computational complexity Vol. 34; no. 2; p. 18
Main Authors:	Alekseev, Yaroslav, Filmus, Yuval, Smal, Alexander V.
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.12.2025 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Boolean functions Complexity Computational Mathematics and Numerical Analysis Computer Science Decision trees Dichotomies Hoisting Lower bounds Polynomials Theorems log-rank conjecture 68Q11 Communication complexity parity decision trees lifting information complexity decision trees
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!