Tight Lower Bounds for Testing Linear Isomorphism

DOI10.1007/978-3-642-40328-6_39zbMath1405.68128OpenAlexW157152022MaRDI QIDQ2851886

Elena Grigorescu, Ning Xie, Karl Wimmer

Publication date: 4 October 2013

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_39

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30) Randomized algorithms (68W20)

Related Items (2)

A unified framework for testing linear‐invariant properties ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case

This page was built for publication: Tight Lower Bounds for Testing Linear Isomorphism