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 3 of 3 for “"balanced function"”.

  1. Parameterized query complexity in quantum computation

    Given a function promised to be constant or balanced. Deutsch's algorithm and it's extension Deutsch-Jozsa are the algorithms that can determine the property of the function in constant number of queries. The algorithm works only on the functions that are promised to be either constant or balanced. …

    lethbridge Repository record for Parameterized query complexity in quantum computation (opens in a new tab)

  2. Problems in extremal and probabilistic combinatorics: cubes, squares and permutations

    … <p>Next we consider Lipschitz bijections between functions from $\{0,1\}^n$ to $\{0,1\}^n$ and consider how much these bijections must ``stretch'' the edges of the hypercube. We answer four questions posed by Rao and Shinkar.<br> 1. We show that there is no $O(1)$-bi-Lipschitz bijection from …

    oxford Repository record for Problems in extremal and probabilistic combinatorics: cubes, squares and permutations (opens in a new tab)

  3. Informed Sampling in Discrete Space, and its Applications

    Sampling has been an important problem in physics, statistics, computer science, and machine learning. When the target distribution is intractable, Metropolis-Hastings algorithms are widely used. Within the Metropolis-Hastings paradigm, informed sampling is defined as using the information of …

    gatech Repository record for Informed Sampling in Discrete Space, and its Applications (opens in a new tab)