scientific article; zbMATH DE number 6767553
From MaRDI portal
Publication:5351927
DOI10.4230/LIPIcs.APPROX-RANDOM.2015.645zbMath1375.68209MaRDI QIDQ5351927
Marco L. Carmosino, Valentine Kabanets, Russell Impagliazzo, Antonina Kolokolova
Publication date: 31 August 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items
Constructive non-commutative rank computation is in deterministic polynomial time, Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time., Non-commutative Edmonds' problem and matrix semi-invariants, On rank-critical matrix spaces, Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing, From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces, Unnamed Item
