Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Milvio Capovani

dblp:75/6965 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3Databases, data management, data science and information retrieval · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 40% Computational complexity · 40% Combinatorics and discrete mathematics · 20%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
algebraic combinatorics
0.011987
Tensor Rank and Border Rank of Band Toeplitz Matrices · SIAM J. Comput. 1987
Computational complexity › algebraic complexity › tensor rank
border rank
0.011987
Tensor Rank and Border Rank of Band Toeplitz Matrices · SIAM J. Comput. 1987
Algorithms and data structures
numerical linear algebra
0.011987
Tensor Rank and Border Rank of Band Toeplitz Matrices · SIAM J. Comput. 1987
Computational complexity › algebraic complexity
tensor rank
0.011987
Tensor Rank and Border Rank of Band Toeplitz Matrices · SIAM J. Comput. 1987
Algorithms and data structures › numerical linear algebra › structured matrices
toeplitz matrix
0.011987
Tensor Rank and Border Rank of Band Toeplitz Matrices · SIAM J. Comput. 1987

Methods — techniques the papers use, named apart from their topics

tensor rank · 0.0border rank · 0.0
YearPublicationVenuePosition
1987 Tensor Rank and Border Rank of Band Toeplitz Matrices
abstract
Let $\mathcal{B}_{n,h,k} $ be the class of $n \times n$ band Toeplitz matrices $A = (a_{i,j} )$ such that $a_{i,j} = 0$ if $i - j \geqq k$ or $j - i \geqq h$, $k \leqq h$ and $\mathcal{S}_{n,k} $ the subclass of $\mathcal{B}_{n,k,k} $ made up by symmetric matrices. We show that ${\operatorname{rk}}_{\bf F} (\mathcal{B}_{n,h,k} ) = n + h - 1$ if the field ${\bf F}$ contains a primitive $(n - 1 + h)$th root of unity, ${\operatorname{brk}}_{\bf F} (\mathcal{B}_{n,h,k} ) = n + k - 1,{\operatorname{rk}}_{\bf R} (\mathcal{S}_{n,k} ) = {\operatorname{brk}}_{\bf R} (\mathcal{S}_{n,k} ) = n + 2\lfloor {{(k - 1)} / 2} \rfloor $ if ${\bf R}$ is the real field and $k \leqq {n / 2}$.
Dario Bini, Milvio Capovani
SIAM J. Comput.2
1979 Lower Bounds of the Complexity of Linear Algebras
Dario Bini, Milvio Capovani
Inf. Process. Lett.2
1979 O(n2.7799) Complexity for n*n Approximate Matrix Multiplication
Dario Bini, Milvio Capovani, Francesco Romani, Grazia Lotti
Inf. Process. Lett.2