Skip to content

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract.

Shalev Ben-David, Eric Blais

VenueA*FOCS
Year2020
ProceedingsFOCS

Browse the full FOCS paper archive.