On the permanent of certain \((0,1)\) Toeplitz matrices (Q1373310): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:08, 5 March 2024

scientific article
Language Label Description Also known as
English
On the permanent of certain \((0,1)\) Toeplitz matrices
scientific article

    Statements

    On the permanent of certain \((0,1)\) Toeplitz matrices (English)
    0 references
    0 references
    0 references
    0 references
    18 November 1997
    0 references
    Computation of the permanent of a matrix is a hard problem, much harder than computation of the determinant. It is very unlikely that a polynomial time algorithm exists. The authors describe briefly the history of this problem and then present their new contributions. They mainly study the special case of \((0,1)\) Toeplitz or circulant matrices with at most three nonzeroes in each row. The subject is related to graph theory. The paper is well organized and ends with conjectures and open questions. This is obviously a field in which much work remains to be done.
    0 references
    Toeplitz matrices
    0 references
    \((0,1)\)-matrices
    0 references
    permanent
    0 references
    determinant
    0 references
    polynomial time algorithm
    0 references
    circulant matrices
    0 references

    Identifiers