Now showing items 251-270 of 433

    • Near-optimal quantum strategies for nonlocal games, approximate representations, and BCS algebras 

      Paul-Paddock, Connor (University of Waterloo, 2023-05-04)
      Quantum correlations can be viewed as particular abstract states on the tensor product of operator systems which model quantum measurement scenarios. In the paradigm of nonlocal games, this perspective illustrates a ...
    • Negative Correlation Properties for Matroids 

      Erickson, Alejandro (University of Waterloo, 2008-12-23)
      In pursuit of negatively associated measures, this thesis focuses on certain negative correlation properties in matroids. In particular, the results presented contribute to the search for matroids which satisfy $$P(\{X:e,f\in ...
    • New Convex Relaxations for the Maximum Cut and VLSI Layout Problems 

      Ferreira Fialho dos Anjos, Miguel Nuno (University of Waterloo, 2001)
      It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for ...
    • A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem 

      White, John Lincoln (University of Waterloo, 2010-09-29)
      The Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on the nodes and their position in the tour. Inequalities ...
    • Node-Weighted Prize Collecting Steiner Tree and Applications 

      Sadeghian Sadeghabad, Sina (University of Waterloo, 2013-05-23)
      The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize ...
    • Noisy Embezzlement of Entanglement and Applications to Entanglement Dilution 

      Lasecki, Dariusz (University of Waterloo, 2019-05-23)
      In this thesis we present the concept of embezzlement of entanglement, its properties, efficiency, possible generalizations and propose the linear programming characterization of this phenomenon. Then, we focus on the noisy ...
    • Noisy Interactive Quantum Communication 

      Shayeghi, Ala (University of Waterloo, 2020-08-25)
      We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n ...
    • Non-Adaptive Matroid Prophet Inequalities 

      Sayutina, Alice (University of Waterloo, 2023-05-04)
      We consider the problem of matroid prophet inequalities. This problem has been ex- tensively studied in case of adaptive prices, with [KW12] obtaining a tight 2-competitive mechanism for all the matroids. However, the ...
    • Non-Constructivity in Security Proofs 

      Soundararajan, Priya (University of Waterloo, 2018-09-10)
      In the field of cryptography, one generally obtains assurances for the security of a cryptographic protocol by giving a reductionist security proof, which is comprised of a reduction from breaking a mathematical problem ...
    • Nonsmooth Newton Methods for Solving the Best Approximation Problem; with Applications to Linear Programming 

      Weames, Tyler (University of Waterloo, 2023-12-19)
      In this thesis, we study the effects of applying a modified Levenberg-Marquardt regularization to a nonsmooth Newton method. We expand this application to exact and inexact nonsmooth Newton methods and apply it to the ...
    • A note on intersecting hypergraphs with large cover number 

      Haxell, P.E.; Scott, A.D. (The Electronic Journal of Combinatorics, 2017-08-11)
      We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r−4 for all but finitely many r. This answers a question of Abu-Khazneh, Barát, Pokrovskiy and Szabó, and shows that a ...
    • A note on simplicial cliques 

      Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Elsevier, 2021-09)
      Motivated by an application in condensed matter physics and quantum information theory, we prove that every non-null even-hole-free claw-free graph has a simplicial clique, that is, a clique K such that for every vertex v ...
    • The Number Field Sieve for Barreto-Naehrig Curves: Smoothness of Norms 

      Shantz, Michael (University of Waterloo, 2015-05-20)
      The security of pairing-based cryptography can be reduced to the difficulty of the discrete logarithm problem (DLP) in finite fields of medium characteristic. The number field sieve is the best known algorithm for this ...
    • Numerical Stability in Linear Programming and Semidefinite Programming 

      Wei, Hua (University of Waterloo, 2006)
      We study numerical stability for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. ...
    • On 2-crossing-critical graphs with a V8-minor 

      Arroyo Guevara, Alan Marcelo (University of Waterloo, 2014-05-22)
      The crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of a graph. A graph $G$ is $k$-crossing-critical if it has crossing number at least $k$, and any subgraph of $G$ has crossing ...
    • On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture 

      Hompe, Patrick; Pelikánová, Petra; Pokorná, Aneta; Spirkl, Sophie (Elsevier, 2021-05-01)
      For a digraph G and v is an element of V(G), let delta(+)(v) be the number of out-neighbors of v in G. The Caccetta-Haggkvist conjecture states that for all k >= 1, if G is a digraph with n = |V(G)| such that delta(+)(v) ...
    • On Algorithms, Separability and Cellular Automata in Quantum Computing 

      Cheung, Donny (University of Waterloo, 2007-09-26)
      In Part I of this thesis, we present a new model of quantum cellular automata (QCA) based on local unitary operations. We will describe a set of desirable properties for any QCA model, and show that all of these properties ...
    • On coloring digraphs with forbidden induced subgraphs 

      Carbonero, Alvaro (University of Waterloo, 2023-04-25)
      This thesis mainly focuses on the structural properties of digraphs with high dichromatic number. The dichromatic number of a digraph $D$, denoted by $\dichi(D)$, is designed to be the directed analog of the chromatic ...
    • On Combinatorics, Integrability and Puzzles 

      Miller, Timothy (University of Waterloo, 2020-10-23)
      In the last decade, many old and new results in combinatorics have been shown using the theory of quantum integrable systems from particle physics. The key to solving such problems is the derivation of an underlying ...
    • On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming 

      Ding, Yichuan (University of Waterloo, 2007-05-18)
      Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages