No article text was recorded for this version.
function composition complexity
Version 1 of 116 papers33 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Classical Lower Bounds from Quantum Upper Bounds
- Blog: Hardness of Function Composition for Semantic Read once Branching Programs
- Blog: The Power of Many Samples in Query Complexity
- Blog: A composition theorem for parity kill number
- Blog: Composition limits and separating examples for some boolean function complexity measures
- Blog: The composition complexity of majority
- Blog: Monadic Decomposability of Regular Relations
- Blog: ANGIE: Active Knowledge for Interactive Exploration
- Blog: Proving Functional Program Equivalence via Directed Lemma Synthesis
- Blog: Log-rank and lifting for AND-functions
- Blog: A decision procedure for linear "big O" equations
- Blog: Dual lower bounds for approximate degree and Markov-Bernstein inequalities
- Blog: Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
- Blog: Degrees of relations on canonically ordered natural numbers and integers
- Blog: A Nearly Optimal Lower Bound on the Approximate Degree of AC0
- Blog: How Compositional is a Model?
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_function_composition_complexity_b76d4f33,
title = {function composition complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/function-composition-complexity/rdr_b76d4f33f10f49c3bcbec0162e1676f6},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_function_composition_complexity_b76d4f33_v1,
title = {function composition complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/function-composition-complexity/rdr_b76d4f33f10f49c3bcbec0162e1676f6/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}