Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"adversary bound"”.

  1. Lower Bounds on Quantum Query and Learning Graph Complexities

    … We almost exclusively focus on proving lower bounds for these computational models. First, we study lower bounds on learning graph complexity. We consider two types of learning graphs: adaptive and, more restricted, non-adaptive learning graphs. We express both adaptive and non-adaptive …

    waterloo Repository record for Lower Bounds on Quantum Query and Learning Graph Complexities (opens in a new tab)