„orthogonal vectors“

Suchergebnisse

1.000+ Treffer

• Algorithms and Complexity on Indexing Elastic Founder Graphs
  Equi, Massimo ; Norri, Tuukka ; Alanko, Jarno ; Cazaux, Bastien ; Tomescu, Alexandru I. ; Mäkinen, Veli 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Stereoselective Diboration of Spirocyclobutenes: A Platform for the Synthesis of Spirocycles with Orthogonal Exit Vectors
  Nóvoa, Luis ; Trulli, Laura ; Parra, Alejandro ; Tortosa, Mariola
• Stereoselective Diboration of Spirocyclobutenes: A Platform for the Synthesis of Spirocycles with Orthogonal Exit Vectors
  Nóvoa, Luis ; Trulli, Laura ; Parra, Alejandro ; Tortosa, Mariola
• The Planted Orthogonal Vectors Problem
  Kühnemann, David ; Polak, Adam ; Rosen, Alon 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Organizing a great team with complementary skills: selecting orthogonal vectors with artificial intelligence
  Takefuji, Yoshiyasu
• Sparsity Lower Bounds for Probabilistic Polynomials
  Alman, Josh ; Chattopadhyay, Arkadev ; Williams, Ryan 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs
  Bringmann, Karl ; Kisfaludi‑Bak, Sándor ; Künnemann, Marvin ; Nusser, André ; Parsaeian, Zahra 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Fine-Grained Complexity of Multi-Dimensional Ordering Properties
  An, Haozhe ; Gurumukhani, Mohit ; Impagliazzo, Russell ; Jaber, Michael ; Künnemann, Marvin ; Nina, Maria Paula Parga 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 4 vs 7 Sparse Undirected Unweighted Diameter is SETH-Hard at Time n^{4/3}
  Bonnet, Édouard 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Counting Short Vector Pairs by Inner Product and Relations to the Permanent
  Björklund, Andreas ; Kaski, Petteri 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio
  Bonnet, Édouard 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• OV Graphs Are (Probably) Hard Instances
  Alman, Josh ; Vassilevska Williams, Virginia 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors
  Björklund, Andreas ; Williams, Ryan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Orthogonal Vectors Conjecture for Branching Programs and Formulas
  Kane, Daniel M. ; Williams, Richard Ryan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity
  Carmosino, Marco L. ; Impagliazzo, Russell ; Sabin, Manuel 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Orthogonal Vectors Indexing
  Goldstein, Isaac ; Lewenstein, Moshe ; Porat, Ely 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Orthogonal vectors in then-dimensional cube and codes with missing distances
  Frankl, P.
• Sets of vectors with many orthogonal paris
  Füredi, Zoltán ; Stanley, Richard
• Orthogonal random vectors and the Hurwitz-Radon-Eckmann theorem
  Vakhania, N.
• Convergence to Zero and Boundedness of Operator-Normed Sums of Random Vectors with Application to Autoregression Processes
  Buldygin, V. V. ; Koval, V. A.