Matches in SemOpenAlex for { <https://semopenalex.org/work/W2907050172> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2907050172 abstract "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 has a rich variety of applications in such areas as graph algorithms, functional programming, circuit complexity, and others. It is easy to compute $Ax$ using $O(u)$ semigroup operations. The main question studied in this paper is: can $Ax$ be computed using $O(z)$ semigroup operations? We prove that in general this is not possible: there exists a matrix $A in {0,1}^{n times n}$ with exactly two zeroes in every row (hence $z=2n$) whose complexity is $Theta(nalpha(n))$ where $alpha(n)$ is the inverse Ackermann function. However, for the case when the semigroup is commutative, we give a constructive proof of an $O(z)$ upper bound. This implies that in commutative settings, complements of sparse matrices can be processed as efficiently as sparse matrices (though the corresponding algorithms are more involved). Note that this covers the cases of Boolean and tropical semirings that have numerous applications, e.g., in graph theory. As a simple application of the presented linear-size construction, we show how to multiply two $ntimes n$ matrices over an arbitrary semiring in $O(n^2)$ time if one of these matrices is a 0/1-matrix with $O(n)$ zeroes (i.e., a complement of a sparse matrix)." @default.
- W2907050172 created "2019-01-11" @default.
- W2907050172 creator A5038669776 @default.
- W2907050172 creator A5041019594 @default.
- W2907050172 creator A5045174507 @default.
- W2907050172 creator A5074870089 @default.
- W2907050172 date "2019-01-01" @default.
- W2907050172 modified "2023-09-26" @default.
- W2907050172 title "Complexity of Linear Operators" @default.
- W2907050172 hasPublicationYear "2019" @default.
- W2907050172 type Work @default.
- W2907050172 sameAs 2907050172 @default.
- W2907050172 citedByCount "0" @default.
- W2907050172 crossrefType "proceedings-article" @default.
- W2907050172 hasAuthorship W2907050172A5038669776 @default.
- W2907050172 hasAuthorship W2907050172A5041019594 @default.
- W2907050172 hasAuthorship W2907050172A5045174507 @default.
- W2907050172 hasAuthorship W2907050172A5074870089 @default.
- W2907050172 hasConcept C114614502 @default.
- W2907050172 hasConcept C118615104 @default.
- W2907050172 hasConcept C121332964 @default.
- W2907050172 hasConcept C134306372 @default.
- W2907050172 hasConcept C17349429 @default.
- W2907050172 hasConcept C183778304 @default.
- W2907050172 hasConcept C207405024 @default.
- W2907050172 hasConcept C207467116 @default.
- W2907050172 hasConcept C21696900 @default.
- W2907050172 hasConcept C2524010 @default.
- W2907050172 hasConcept C33436860 @default.
- W2907050172 hasConcept C33923547 @default.
- W2907050172 hasConcept C62520636 @default.
- W2907050172 hasConcept C77553402 @default.
- W2907050172 hasConcept C84114770 @default.
- W2907050172 hasConceptScore W2907050172C114614502 @default.
- W2907050172 hasConceptScore W2907050172C118615104 @default.
- W2907050172 hasConceptScore W2907050172C121332964 @default.
- W2907050172 hasConceptScore W2907050172C134306372 @default.
- W2907050172 hasConceptScore W2907050172C17349429 @default.
- W2907050172 hasConceptScore W2907050172C183778304 @default.
- W2907050172 hasConceptScore W2907050172C207405024 @default.
- W2907050172 hasConceptScore W2907050172C207467116 @default.
- W2907050172 hasConceptScore W2907050172C21696900 @default.
- W2907050172 hasConceptScore W2907050172C2524010 @default.
- W2907050172 hasConceptScore W2907050172C33436860 @default.
- W2907050172 hasConceptScore W2907050172C33923547 @default.
- W2907050172 hasConceptScore W2907050172C62520636 @default.
- W2907050172 hasConceptScore W2907050172C77553402 @default.
- W2907050172 hasConceptScore W2907050172C84114770 @default.
- W2907050172 hasLocation W29070501721 @default.
- W2907050172 hasOpenAccess W2907050172 @default.
- W2907050172 hasPrimaryLocation W29070501721 @default.
- W2907050172 hasRelatedWork W1495932320 @default.
- W2907050172 hasRelatedWork W158195002 @default.
- W2907050172 hasRelatedWork W1859614188 @default.
- W2907050172 hasRelatedWork W1881450209 @default.
- W2907050172 hasRelatedWork W1890636210 @default.
- W2907050172 hasRelatedWork W1969557621 @default.
- W2907050172 hasRelatedWork W1970452008 @default.
- W2907050172 hasRelatedWork W2116603945 @default.
- W2907050172 hasRelatedWork W2137828924 @default.
- W2907050172 hasRelatedWork W2173819663 @default.
- W2907050172 hasRelatedWork W2182311426 @default.
- W2907050172 hasRelatedWork W2185718957 @default.
- W2907050172 hasRelatedWork W2794887178 @default.
- W2907050172 hasRelatedWork W2949391574 @default.
- W2907050172 hasRelatedWork W2949409619 @default.
- W2907050172 hasRelatedWork W3006568939 @default.
- W2907050172 hasRelatedWork W3013848491 @default.
- W2907050172 hasRelatedWork W3029679829 @default.
- W2907050172 hasRelatedWork W3129328269 @default.
- W2907050172 hasRelatedWork W2520333282 @default.
- W2907050172 isParatext "false" @default.
- W2907050172 isRetracted "false" @default.
- W2907050172 magId "2907050172" @default.
- W2907050172 workType "article" @default.