Pages that link to "Item:Q4638110"

The following pages link to Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110):

Displaying 8 items.

• Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
• On rank-critical matrix spaces (Q1679671) (← links)
• General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
• An exponential lower bound for the degrees of invariants of cubic forms and tensor actions (Q2180892) (← links)
• Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
• Simultaneous robust subspace recovery and semi-stability of quiver representations (Q2662209) (← links)
• Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
• The regularity lemma is false over small fields (Q5220638) (← links)