„Query algorithms and complexity“

Suchergebnisse

66 Treffer

• Span Programs and Quantum Time Complexity
  Cornelissen, Arjan ; Jeffery, Stacey ; Ozols, Maris ; Piedrafita, Alvaro 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
  Ambainis, Andris ; Balodis, Kaspars ; Iraids, Jānis ; Khadiev, Kamil ; Kļevickis, Vladislavs ; Prūsis, Krišjānis ; Shen, Yixin ; Smotrovs, Juris ; Vihrovs, Jevgēnijs 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation
  Chen, Yu ; Kannan, Sampath ; Khanna, Sanjeev 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributional Property Testing in a Quantum World
  Gilyén, András ; Li, Tongyang 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge
  Ben-David, Shalev ; Kothari, Robin 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Composition Theorem for Randomized Query Complexity
  Anshu, Anurag ; Gavinsky, Dmitry ; Jain, Rahul ; Kundu, Srijita ; Lee, Troy ; Mukhopadhyay, Priyanka ; Santha, Miklos ; Sanyal, Swagato 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimal Quantum Algorithm for Polynomial Interpolation
  Childs, Andrew M. ; van Dam, Wim ; Hung, Shih-Han ; Shparlinski, Igor E. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Polynomials, Quantum Query Complexity, and Grothendieck's Inequality
  Aaronson, Scott ; Ambainis, Andris ; Iraids, Janis ; Kokainis, Martins ; Smotrovs, Juris 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact Quantum Query Complexity of EXACT and THRESHOLD
  Ambainis, Andris ; Iraids, Janis ; Smotrovs, Juris 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Easy and Hard Functions for the Boolean Hidden Shift Problem
  Childs, Andrew M. ; Kothari, Robin ; Ozols, Maris ; Roetteler, Martin 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum query complexity of minor-closed graph properties
  Childs, Andrew M. ; Kothari, Robin 2011 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Fine-Grained Query Complexity of Symmetric Functions
  Podder, Supartha ; Yao, Penghui ; Ye, Zekun
• Theory for processing data on the Web
  Martens, Wim
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XLII
  2019 Springer International Publishing
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XLI – Special Issue on Data and Security Engineering
  2019 Springer International Publishing
• Transactions on Large-Scale Data- and Knowledge-Centered Systems I
  2009 Springer Berlin Heidelberg
• Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity
  Gong, Suning ; Nong, Qingqin ; Fang, Jiazhu ; Du, Ding-Zhu
• Transactions on computational science
  Gavrilova, Marina L. ; Tan, C. J. Kenneth ; Coates, Mark ; Hu, Yaoping ; Leung, Henry ; Mohammadi, Arash ; Plataniotis, Konstantinos N. ; de Oliveira, Helder Rodrigues 2023 Springer
• Small PCPs with low query complexity
  Harsha, P. ; Sudan, M.
• FLAG: Towards Graph Query Autocompletion for Large Graphs
  Yi, Peipei ; Li, Jianping ; Choi, Byron ; Bhowmick, Sourav S. ; Xu, Jianliang