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 20 of 183 for “"Direct Product"”.

  1. Kings in the Direct Product of Digraphs

    … that can reach every other vertex in D by a directed path of length at most k. A king is a vertex that is a k-king for some k. We will look at kings in the direct product of digraphs and characterize a relationship between kings in the product and kings in the factors. This is a continuation …

    vcu Repository record for Kings in the Direct Product of Digraphs (opens in a new tab)

  2. DIRECT PRODUCT, FUNCTION COMPOSITION AND DEVICE-INDEPENDENT CRYPTOGRAPHY

    In this thesis, we study direct product and composition theorems in query complexity, communication complexity and non-local games, and show applications of these results in device-independent cryptography. The first part of the thesis deals with direct product and composition theorems. Our first …

    nus Repository record for DIRECT PRODUCT, FUNCTION COMPOSITION AND DEVICE-INDEPENDENT CRYPTOGRAPHY (opens in a new tab) Download file for DIRECT PRODUCT, FUNCTION COMPOSITION AND DEVICE-INDEPENDENT CRYPTOGRAPHY (opens in a new tab)

  3. A Study of the Direct Product of Matrices

    … matrix of order & B is a matrix of order B, the direct product, A X B, is a matrix of order & B as defined by C. C. MacDuffee in An Introduction to Abstract Algebra. The question arises as to whether there are any relationships between A X B and A and B, as, for instance, between the …

    marquette Repository record for A Study of the Direct Product of Matrices (opens in a new tab)

  4. Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs

    … graphs have unique prime factorizations over the direct product, the same cannot be said of bipartite graphs. This is somewhat vexing, as bipartite graphs do have unique prime factorizations over other graph products (the Cartesian product, for example). However, it is fairly easy to show that a …

    vcu Repository record for Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs (opens in a new tab)

  5. Computational complexity of digraph decomposition and the congruence extension property for algebras

    <p>The strong direct product is one of the standard graph products. In 1992, Feigenbaum and Schaffer presented a polynomial-time algorithm to find the unique prime factorization of connected graphs under the strong direct product. In this paper, we show that weakly connected directed graphs have …

    iastate Repository record for Computational complexity of digraph decomposition and the congruence extension property for algebras (opens in a new tab)

  6. Studies in Communication Complexity and Semidefinite Programs

    … programs. The second part concerns strong direct product results in communication complexity. In the first part, we study fast parallel approximation algorithms for certain classes of semidefinite programs. In Chapter 3, we present a fast parallel approximation algorithm for positive …

    nus Repository record for Studies in Communication Complexity and Semidefinite Programs (opens in a new tab) Download file for Studies in Communication Complexity and Semidefinite Programs (opens in a new tab)

  7. Minimality of Group and Monoid Presentations

    … a theorem on the efficiency of standard wreath products of two finite groups. We also present some applications of the theorem and end by giving examples. Chapter 4 sees discussion on the semi-direct product of any two monoids. In particular we prove necessary and sufficient conditions for the …

    glasgow Download PDF for Minimality of Group and Monoid Presentations (opens in a new tab)

  8. Sobre coloração total de grafos Kneser e de grafos produto direto de completos e de ciclos

    … classes of graphs is studied: Kneser graphs, direct product of complete graphs and direct product of cycle graphs. In the class of Kneser graphs K(n, s), we show that the most sparse connected K(2k − 1, k − 1), known as Odd Graphs, are Type 1 and we prove that the dense Kneser graphs K(n, 2) …

    brazil-uerj Repository record for Sobre coloração total de grafos Kneser e de grafos produto direto de completos e de ciclos (opens in a new tab)

  9. The Inner Power of a Graph

    … of a graph. The construction is similar to the direct power of graphs, except that factors are intertwined in such a way that certain structural properties of graphs are more clearly reflected in their inner powers. We investigate various properties of inner powers, such as connectivity, …

    vcu Repository record for The Inner Power of a Graph (opens in a new tab)

  10. Warped Compactification on General Manifolds

    … general class of spacetimes that are "warped product manifolds." We will show that the Kaluza-Klein spectrum for the free warped scalar field is the same as if the full product space were a direct product manifold (un-warped). In this process, we will derive the warped scalar Laplacian. We …

    umn Repository record for Warped Compactification on General Manifolds (opens in a new tab)

Page 1 of 10