Results 11 to 20 of about 531,507 (259)
The Linear Complexity of a Graph [PDF]
The Electronic Journal of Combinatorics, 2006 The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In this paper, we define the linear complexity of a graph to be the linear complexity of any one of its associated adjacency matrices.
David L. Neel, Michael E. Orrison
openaire +2 more sources
Complexity of Linear Circuits and Geometry [PDF]
Foundations of Computational Mathematics, 2015 We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border) rigidity, (ii) compute degrees of varieties associated to rigidity, (iii) describe algebraic varieties associated to ...
Fulvio Gesmundo +3 more
openaire +5 more sources
The Computational Complexity of Linear Optics [PDF]
Research in Optical Sciences, 2011 We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation in which identical photons are generated, sent through a linear-optical network, then nonadaptively measured to ...
Aaronson, Scott, Arkhipov, Aleksandr
openaire +6 more sources
On the Linear Complexity of Feedback Registers [PDF]
IEEE Transactions on Information Theory, 1990 In this paper, we study sequences generated by arbitrary feedback registers (not necessarily feedback shift registers) with arbitrary feedforward functions. We generalize the definition of linear complexity of a sequence to the notions of strong and weak linear complexity of feedback registers. A technique for finding upper bounds for the strong linear
Agnes Hui Chan +2 more
openaire +2 more sources
Complexity of linear programming
Operations Research Letters, 1982 The complexity of linear programming is discussed in the "integer" and "real number" models of computation. Even though the integer model is widely used in theoretical computer science, the real number model is more useful for estimating an algorithm's running time in actual computation.
Traub, Joseph F., Wozniakowski, Henryk
openaire +4 more sources
The complexity of linear programming
Theoretical Computer Science, 1980 AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is studied. A notion of LP-completeness is introduced, and a set of problems is shown to be (polynomially) equivalent to linear programming. Many of these problems involve computation of subsets of convex hulls of polytopes, and require O(n log n) operations
David P. Dobkin, Steven P. Reiss
openaire +3 more sources
Remote Sensing, 2022 In this paper, we propose the specific recursion formula for the generalized labeled multi-Bernoulli filter based on the track-before-detect strategy (GLMB-TBD) using a belief propagation algorithm. The proposed method aims to track multiple weak targets
Chenghu Cao, Yongbo Zhao
doaj +1 more source
Complexity of Linear Operators
Electron. Colloquium Comput. Complex., 2018 Let $A \in \{0,1\}^{n \times n}$ be a matrix with $z$ zeroes and $u$ ones and $x$ be an $n$-dimensional vector of formal variables over a semigroup $(S, \circ)$. How many semigroup operations are required to compute the linear operator $Ax$? As we observe in this paper, this problem contains as a special case the well-known range queries problem and ...
Alexander S. Kulikov +3 more
openaire +5 more sources
The linear complex of conics [PDF]
Transactions of the American Mathematical Society, 1925 1. Although the complex of first degree curves, that is, the rectilinear complex, has been thoroughly investigated, very little exists in the literature concerning the space complex of curves of the second degree. It is the purpose of this paper to discuss the linear complex of such curves. Just what would be a linear complex of curves depends, largely,
openaire +1 more source
The gradient complexity of linear regression
CoRR, 2019 We investigate the computational complexity of several basic linear algebra primitives, including largest eigenvector computation and linear regression, in the computational model that allows access to the data via a matrix-vector product oracle. We show that for polynomial accuracy, $Θ(d)$ calls to the oracle are necessary and sufficient even for a ...
Mark Braverman +3 more
openaire +4 more sources