Skip to content

Author

Samruddhi Pednekar

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

A General Composition Theorem for Approximate Degree

A longstanding open question in Boolean function complexity asks whether approximate degree composes multiplicatively under block composition. Although a general multiplicative upper bound is known, matching lower bounds have previously been established only for restricted classes of functions. We resolve this question...

Samruddhi Pednekar, Supartha Podder · 1 citation
Preprint Nov 2026

Composition Theorem for Randomized Query Complexity

For bounded-error randomized query complexity, we resolve the composition conjecture up to logarithmic factors. The general upper bound $R(f\circ g) = O\!\left(R(f)R(g)\log(R(f)+1)\right)$ was already known. Although Meiburg recently disproved constant-factor multiplicative composition for total Boolean functions, the...

Samruddhi Pednekar, Supartha Podder · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.