相关论文: A Collapse Theorem for Holographic Algorithms with…

A holographic algorithm solves a problem in domain of size $n$, by reducing it to counting perfect matchings in planar graphs. It may simulate a $n$-value variable by a bunch of $t$ matchgate bits, which has $2^t$ values. The transformation…

The theory of holographic algorithms introduced by Valiant represents a novel approach to achieving polynomial-time algorithms for seemingly intractable counting problems via a reduction to counting planar perfect matchings and a linear…

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized by matchgates under a suitable basis transformation (SRP). For holographic algorithms on domain size 2, [1, 2, 4, 5]…

Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among…

The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields insight into the hierarchy of complexity classes. In particular, the theory produces algebraic tests for a…

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…

We prove a complexity classification theorem that classifies all counting constraint satisfaction problems ($\#$CSP) over Boolean variables into exactly three categories: (1) Polynomial-time tractable; (2) $\#$P-hard for general instances,…

Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…

The theoretical basis of the phenomenon of effective and exact dimensional reduction, or holographic correspondence, is investigated in a wide variety of physical systems. We first derive general inequalities linking quantum systems of…

Embedding-based representations in Euclidean space $\mathbb{R}^d$ are a cornerstone of modern machine learning, where a major goal is to use the \emph{smallest dimension} that faithfully captures data relations. In this work, we prove sharp…

Given a polygon $H$ in the plane, the art gallery problem calls for fining the smallest set of points in $H$ from which every other point in $H$ is seen. We give a deterministic algorithm that, given any polygon $H$ with $h$ holes, $n$…

Using Matrix Theory as a concrete example of a fundamental holographic theory, we show that the emergent macroscopic spacetime displays a new macroscopic quantum structure, holographic geometry, and a new observable phenomenon, holographic…

An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We…

We present an algorithm for generating merger histories of dark matter haloes. The algorithm is based on the excursion set approach with moving barriers whose shape is motivated by the ellipsoidal collapse model of halo formation. In…

It remains an open question whether the apparent additional power of quantum computation derives inherently from quantum mechanics, or merely from the flexibility obtained by "lifting" Boolean functions to linear operators and evaluating…

This paper presents an automatic approach for the evaluation of the plastic load and failure modes of planar frames. The method is based on the generation of elementary collapse mechanisms and on their linear combination aimed at minimizing…

In-line holographic microscopy provides an unparalleled wealth of information about the properties of colloidal dispersions. Analyzing one colloidal particle's hologram with the Lorenz-Mie theory of light scattering yields the particle's…

We introduce a universally applicable method, based on the bond-algebraic theory of dualities, to search for generalized order parameters in disparate systems including non-Landau systems with topological order. A key notion that we advance…

One of the main goals of modern cosmology remains to summon up a self consistent policy, able to explain, in the framework of the Einstein's theory, the cosmic speed up and the presence of Dark Matter in the Universe. Accordingly to the…

A fundamental question in computational geometry is for a set of input points in the Euclidean space, that is subject to discrete changes (insertion/deletion of points at each time step), whether it is possible to maintain an approximate…