Related papers: Circuits in Extended Formulations
Circuit algebras are a symmetric version of Jones's planar algebras. They originated in quantum topology as a framework for encoding virtual crossings. This paper extends existing results for modular operads to construct a graphical…
This paper is aimed at presenting a systematic survey of the existing now different formulations for the problem of projection of the origin of the Euclidean space onto the convex polyhedron (PPOCP). In the present paper, there are…
We show that new definitions of the notion of "projection" on which some of the recent "extended formulations" works (such as Kaibel (2011); Fiorini et al. (2011; 2012); Kaibel and Walter (2013); Kaibel and Weltge (2013) for example) have…
This paper establishes a rigorous connection between circuit representations and tensor factorizations, two seemingly distinct yet fundamentally related areas. By connecting these fields, we highlight a series of opportunities that can…
We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…
Both the combinatorial and the circuit diameters of polyhedra are of interest to the theory of linear programming for their intimate connection to a best-case performance of linear programming algorithms. We study the diameters of dual…
In this article, we study the Hilbert scheme of generically non-reduced curves in $\mathbb{P}^3$. We prove the existence of generically non-reduced curves in $\mathbb{P}^3$ for which there exist infinitesimal deformations of the curve that…
High-dimensional quantum computation needs a native circuit-level equational theory for qudits. We give the first finite schematic equational theory that is sound and complete for exact unitary qudit circuits in every finite dimension at…
Phylogenetic networks are generalizations of trees that allow for the modeling of non-tree like evolutionary processes. Split networks give a useful way to construct networks with intuitive distance structures induced from the associated…
We study a new flexible method to extend linearly the graph of a non-linear, and usually not bijective, function so that the resulting extension is a bijection. Our motivation comes from cryptography. Examples from symmetric cryptography…
In this dissertation we study basic local differential geometry, projective differential geometry, and prolongations of overdetermined geometric partial differential equations. It is simple to prolong an n-th order linear ordinary…
We give new evidence that quantum circuits are substantially more powerful than classical circuits. We show, relative to a random oracle, that polynomial-size quantum circuits can sample distributions that subexponential-size classical…
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…
Parameterized quantum circuits play an essential role in the performance of many variational hybrid quantum-classical (HQC) algorithms. One challenge in implementing such algorithms is to choose an effective circuit that well represents the…
This paper continues the application of circuit theory to experimental design started by the first two authors. The theory gives a very special and detailed representation of the kernel of the design model matrix. This representation turns…
Classical circuit complexity characterizes parallel computation in purely combinatorial terms, ignoring the physical constraints that govern real hardware. The standard classes $\mathbf{NC}$, $\mathbf{AC}$, and $\mathbf{TC}$ treat unlimited…
Theoretical computer scientists have been debating the role of oracles since the 1970's. This paper illustrates both that oracles can give us nontrivial insights about the barrier problems in circuit complexity, and that they need not…
In this paper, we study the computational complexity of the commutative determinant polynomial computed by a class of set-multilinear circuits which we call regular set-multilinear circuits. Regular set-multilinear circuits are commutative…
In this paper we propose a generalization of the extension complexity of a polyhedron $Q$. On the one hand it is general enough so that all problems in $P$ can be formulated as linear programs with polynomial size extension complexity. On…
Komj\'ath, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in their compactness theorem that those matroids always admit…