Oracle query
Algorithms whose cost is counted in calls to a black-box function.
24 records
Inside
No folders here. That is a gap in the catalogue, not a page that failed to load.
Records here
- The Abelian hidden subgroup problem
- Bernstein–Vazirani hidden-string circuit
- Counterfeit coin problem by quantum queries
- Deutsch–Jozsa query circuit
- Testing properties of distributions given by sample oracles
- Effective resistance of an electrical network
- Graph collision on a known graph
- Quantum query complexity of graph properties in the adjacency matrix model
- Property testing of bounded-degree graphs in the adjacency list model
- Testing commutativity of a black-box group
- Group order and membership for black-box groups
- Hidden nonlinear structures over finite fields
- Hidden shift problem
- Quantum dynamic programming for path in the hypercube
- Commutativity testing of a matrix set by quantum walk
- Matrix products over semirings
- Matrix product verification by quantum walk
- Matrix rank by a span program
- NAND tree evaluation with discrete queries
- Ordered search
- Polynomial interpolation from oracle queries
- Finding the center of a radial function with the curvelet transform
- Search with wildcards
- String pattern matching by quantum search and deterministic sampling