Now showing items 1-1 of 1

    • A composition theorem for randomized query complexity 

      Anshu, Anurag; Gavinsky, Dmitry; Jain, Rahul; Kundu, Srijita; Lee, Troy; Mukhopadhyay, Priyanka; Santha, Miklos; Sanyal, Swagato (2018)
      Let the randomized query complexity of a relation for error probability epsilon be denoted by R_epsilon(). We prove that for any relation f contained in {0,1}^n times R and Boolean function g:{0,1}^m -> {0,1}, R_{1/3}(f o ...