Orthogonal vectors indexing
From MaRDI portal
Recommendations
Cites work
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Conditional lower bounds for space/time tradeoffs
- Consequences of Faster Alignment of Sequences
- Dictionary matching and indexing with errors and don't cares
- Distance oracles beyond the Thorup-Zwick bound
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Fast set intersection and two-patterns matching
- Faster Online Matrix-Vector Multiplication
- Finding orthogonal vectors in discrete structures
- scientific article; zbMATH DE number 2086643 (Why is no real title available?)
- Lower bounds based on the exponential time hypothesis
- More applications of the polynomial method to algorithm design
- On the complexity of k-SAT
- On the possibility of faster \textsc{SAT} algorithms
- Partial-Match Retrieval Algorithms
- Subtree isomorphism revisited
- Two-dimensional range diameter queries
- Which problems have strongly exponential complexity?
Cited in
(8)- Orthogonal vector measures
- Index Vector Elimination – Making Index Vectors Affordable
- Improved space-time tradeoffs for \(k\)SUM
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas
- More consequences of falsifying SETH and the orthogonal vectors conjecture
- An equivalence class for orthogonal vectors
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
This page was built for publication: Orthogonal vectors indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136259)
