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 5 of 5 for “"Parity Function"”.

  1. On selecting programmable space compactors for built-in self-text using genetic algorithms

    … compactors, such as the popular parity function. Recently, a class of circuit-specific space compactors, known as programmable space compactors (PSCs), has been proposed. A PSC is a highly effective space compactor tailored for a specific circuit under test (CUT) subjected to a …

    ubc Repository record for On selecting programmable space compactors for built-in self-text using genetic algorithms (opens in a new tab) Download PDF for On selecting programmable space compactors for built-in self-text using genetic algorithms (opens in a new tab)

  2. Efficient quantum communication protocols and asynchronism in the toric code

    … by the introduction of more general Boolean functions. The first studied problem is the one of approximating the Hamming distance in the simultaneous message passing model in communication complexity --- a natural generalisation of the Equality problem. An efficient quantum communication …

    bristol Repository record for Efficient quantum communication protocols and asynchronism in the toric code (opens in a new tab) Download PDF for Efficient quantum communication protocols and asynchronism in the toric code (opens in a new tab)

  3. A Proposed Algorithm Toward Uniform-distribution Monotone DNF Learning

    … up the problem of whether polynomial-size DNF functions are PAC learnable in polynomial time. It has been about twenty years that the DNF learning problem has been widely regarded as one of the most important ---and challenging --- open questions in Computational Learning Theory. We consider a …

    duquesne Repository record for A Proposed Algorithm Toward Uniform-distribution Monotone DNF Learning (opens in a new tab)

  4. Low-depth circuit size bounds using combinatorial methods

    … size lower bounds for the clique, threshold and parity functions. The thesis is centred around the combinatorial tools and questions relevant for attacking these circuit size lower bound problems.<br><br>First, the analysis will focus on the maximum one-sided correlation achievable between …

    oxford Repository record for Low-depth circuit size bounds using combinatorial methods (opens in a new tab)

  5. Correlating convergence in product design

    … there are signs of convergence in both form and function that have occurred across many products, and product categories. Producers and consumers always clamor for devices that are useful and convenient, take advantage of the latest technologies, and yet remain intuitive, attractive, and easy to …

    gatech Repository record for Correlating convergence in product design (opens in a new tab)