scientific article; zbMATH DE number 6783479

zbMath1376.68166MaRDI QIDQ5365127

Neeraj Kayal

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133144

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Related Items (18)

Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Isomorphism testing of read-once functions and polynomials ⋮ Complete decomposition of symmetric tensors in linear time and polylogarithmic precision ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ ⋮ Diagonalizable higher degree forms and symmetric tensors ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Unnamed Item ⋮ Orthogonal tensor decomposition and orbit closures from a linear algebraic perspective ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ Linear projections of the Vandermonde polynomial ⋮ Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case ⋮ Unifying known lower bounds via geometric complexity theory

This page was built for publication: