Get started
Keyword

query complexity

Description: A measure of the number of information queries an algorithm requires to solve a computational problem, studied in theoretical computer science.
OpenAlex ID: keywords/query-complexity
A study of the behavior of several methods for balancing machine learning training data
2004 · Gustavo E. A. P. A. Batista, Ronaldo C. Prati, et al. · ACM SIGKDD Explorations Newsletter · 4,218
Optimal implementation of conjunctive queries in relational data bases
1977 · Ashok K. Chandra, Philip M. Merlin · ACM Symposium on Theory of Computing (STOC) · 1,250
PDF
Property testing and its connection to learning and approximation
1998 · Oded Goldreich, Shari Goldwasser, et al. · Journal of the ACM · 1,020
PDF
Hamiltonian Simulation by Qubitization
2019 · Guang Hao Low, Isaac L. Chuang · Quantum · 851
PDF
How are we searching the World Wide Web? A comparison of nine search engine transaction logs
2005 · Bernard J. Jansen, Amanda Spink · Information Processing & Management · 800
Optimal Hamiltonian Simulation by Quantum Signal Processing
2017 · Guang Hao Low, Isaac L. Chuang · Physical Review Letters · 774
PDF
Quantum Walk Algorithm for Element Distinctness
2007 · Andris Ambainis · SIAM Journal on Computing · 704
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
2006 · Mihir Bellare, Phillip Rogaway · Lecture notes in computer science · 674
PDF
Complexity measures and decision tree complexity: a survey
2002 · Harry Buhrman, Ronald de Wolf · Theoretical Computer Science · 666
PDF
Hamiltonian Simulation by Qubitization
2019 · Low, Guang Hao, Chuang, Isaac L. · DSpace@MIT (Massachusetts Institute of Technology) · 655
PDF
Relational queries computable in polynomial time
1986 · Neil Immerman · Information and Control · 643
PDF
Quantum lower bounds by polynomials
2001 · Robert Beals, Harry Buhrman, et al. · Journal of the ACM · 623
Structure and complexity of relational queries
1982 · Ashok Chandra, David Harel · Journal of Computer and System Sciences · 563
Branching Programs and Binary Decision Diagrams
2000 · Ingo Wegener · Society for Industrial and Applied Mathematics eBooks · 478
Schema mediation in peer data management systems
2004 · A.Y. Halevy, Z.G. Ives, et al. · Proceedings - International Conference on Data Engineering · 439
Quantum Computers Can Search Arbitrarily Large Databases by a Single Query
1997 · Lov K. Grover · Physical Review Letters · 432
PDF
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
2018 · Ryan Babbush, Craig Gidney, et al. · Physical Review X · 381
PDF
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
2015 · Dominic W. Berry, Andrew M. Childs, et al. · Annual Symposium on Foundations of Computer Science · 372
PDF
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
2005 · Greg Kuperberg · SIAM Journal on Computing · 348
PDF
Quantum lower bounds for the collision and the element distinctness problems
2004 · Scott Aaronson, Yaoyun Shi · Journal of the ACM · 328
Exponential improvement in precision for simulating sparse Hamiltonians
2014 · Dominic W. Berry, Andrew M. Childs, et al. · ACM Symposium on Theory of Computing (STOC) · 323
PDF
Data integration with uncertainty
2008 · Xin Luna Dong, Alon Halevy, et al. · The VLDB Journal · 316
Quantum Algorithms for the Triangle Problem
2007 · Frédéric Magniez, Miklos Santha, et al. · SIAM Journal on Computing · 311
Property Testing in Bounded Degree Graphs
2002 · Goldreich, Ron · Algorithmica · 309
Analysis and performance of inverted data base structures
1975 · Alfonso F. Cárdenas · Communications of the ACM · 307
PDF
Works count: 5,248
Citation count: 66,760
Year
Topic
Type