• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Shalev Ben-DavidEric Blais
Published in: FOCS (2020)
Keyphrases
  • extended abstract
  • query complexity
  • data complexity
  • lower bound
  • membership queries
  • upper bound
  • concept class
  • special case
  • worst case
  • dnf formulas