Finding orthogonal vectors in discrete structures
From MaRDI portal
Publication:5384097
DOI10.1137/1.9781611973402.135zbMath1422.68276OpenAlexW4253255388MaRDI QIDQ5384097
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.135
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (11)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Efficiently correcting matrix products ⋮ Lengths of words accepted by nondeterministic finite automata ⋮ Counting Solutions to Polynomial Systems via Reductions ⋮ Unnamed Item ⋮ When can graph hyperbolicity be computed in linear time? ⋮ Into the square: on the complexity of some quadratic-time solvable problems ⋮ Unnamed Item ⋮ The Orthogonal Vectors Conjecture for Branching Programs and Formulas ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Finding orthogonal vectors in discrete structures
