Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time.
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ITCS.2017.55 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3927357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hilbert null-cone on tuples of matrices and bilinear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5351927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem for free fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem for free fields: a correction and an addendum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CONSTRUCTION OF THE FREE FIELD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Cartan subalgebras of Lie algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial bounds for rings of invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial degree bounds for matrix semi-invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-commutative rank and tensor rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-invariants of quivers as determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMALL MAXIMAL SPACES OF NON-INVERTIBLE MATRICES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector spaces of matrices of low rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical complexity and quantum entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3467518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Wong sequences and their applications to Edmonds' problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commutative Edmonds' problem and matrix semi-invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular spaces of matrices and their application in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CONSTRUCTIVE THEORY OF INVARIANTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-invariants of quivers for arbitrary dimension vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits: A survey of recent results and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenvalue problem \(\lambda Tx+Sx\) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8166/pdf/LIPIcs-ITCS-2017-55.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2794923896 / rank
 
Normal rank
Property / title
 
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (English)
Property / title: Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ITCS.2017.55 / rank
 
Normal rank

Latest revision as of 14:56, 30 December 2024

scientific article; zbMATH DE number 6866345
Language Label Description Also known as
English
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time.
scientific article; zbMATH DE number 6866345

    Statements

    0 references
    0 references
    0 references
    3 May 2018
    0 references
    invariant theory
    0 references
    non-commutative rank
    0 references
    null cone
    0 references
    symbolic determinant identity testing
    0 references
    semi-invariants of quivers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references