Pages that link to "Item:Q1307698"

The following pages link to The computational complexity of some problems of linear algebra (Q1307698):

Displaying 28 items.

• Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
• On the complexity of the generalized MinRank problem (Q390388) (← links)
• Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
• The complexity of tensor rank (Q722207) (← links)
• Rank minimization with applications to image noise removal (Q781854) (← links)
• Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
• Zero forcing in iterated line digraphs (Q1727740) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
• Minimal rank completions for overlapping blocks (Q2041773) (← links)
• An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
• A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices (Q2089763) (← links)
• An algebraic approach to the rank support learning problem (Q2118561) (← links)
• Efficient key recovery for all HFE signature variants (Q2120067) (← links)
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
• General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
• The product of matrix subspaces (Q2261535) (← links)
• On the complexity of matrix rank and rigidity (Q2268340) (← links)
• Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
• Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353) (← links)
• Roots of Square: Cryptanalysis of Double-Layer Square and Square+ (Q3102785) (← links)
• A family of weak keys in HFE and the corresponding practical key-recovery (Q3225750) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• Revisiting algebraic attacks on MinRank and on the rank decoding problem (Q6063136) (← links)
• Connections between graphs and matrix spaces (Q6074039) (← links)
• RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953) (← links)