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 “"algebraic complexity theory"”.

  1. Border Subrank of Tensors

    … play central roles in several areas including algebraic complexity theory and quantum information theory. The set of maximal subrank tensors is understood. However, less things were know about maximal border subrank tensors. We prove a lower bound on the dimension of the set of maximal border …

    tamu Repository record for Border Subrank of Tensors (opens in a new tab)

  2. Concise Tensors of Minimal Border Rank

    … when m = 5, 6. We solve the classical problem in algebraic complexity theory of classifying minimal border rank tensors in the special case m = 5. Our proofs utilize two recent developments: 111-equations defined by Buczyńska–Buczyński and results of Jelisiejew–Šivic on the variety ´ of commuting …

    tamu Repository record for Concise Tensors of Minimal Border Rank (opens in a new tab)

  3. Classification of Tripartite Tensors with Small Geometric Ranks

    … by Kopparty et al. as a useful tool to study algebraic complexity theory, extremal combinatorics and quantum information theory. This dissertation studies the classification of tripartite tensors with small geometric ranks. We introduce primitive tensors and compression tensors, which reduces …

    tamu Repository record for Classification of Tripartite Tensors with Small Geometric Ranks (opens in a new tab)

  4. Tensors: Entanglement, Geometry, and Combinatorics

    In this thesis, we use algebraic-geometric and combinatorial techniques to study tensor decompositions, with applications in quantum information theory, algebraic complexity theory, and algebraic statistics. A tensor is a multilinear map. These objects naturally generalize matrices, and have many …

    waterloo Repository record for Tensors: Entanglement, Geometry, and Combinatorics (opens in a new tab)

  5. New Lower Bounds in Algebraic Complexity and Connections to Polynomial Identity Testing

    Computational complexity theory asks a deceptively simple question: What makes some problems fundamentally harder than others? By studying the resources needed to solve computational tasks---such as time, memory, and amount of allowed randomness---this field aims to reveal the fundamental limits of …

    toronto-retro Repository record for New Lower Bounds in Algebraic Complexity and Connections to Polynomial Identity Testing (opens in a new tab)