Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > AMORTIZED COMPLEXITY:
Reports tagged with amortized complexity:
TR11-123 | 15th September 2011
Mark Braverman

#### Interactive information complexity

The primary goal of this paper is to define and study the interactive information complexity of functions. Let $f(x,y)$ be a function, and suppose Alice is given $x$ and Bob is given $y$. Informally, the interactive information complexity $IC(f)$ of $f$ is the least amount of information Alice and Bob ... more >>>

TR21-035 | 13th March 2021
Robert Robere, Jeroen Zuiddam

#### Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms

We study the amortized circuit complexity of boolean functions.

Given a circuit model $\mathcal{F}$ and a boolean function $f : \{0,1\}^n \rightarrow \{0,1\}$, the $\mathcal{F}$-amortized circuit complexity is defined to be the size of the smallest circuit that outputs $m$ copies of $f$ (evaluated on the same input), ... more >>>

ISSN 1433-8092 | Imprint