„Query Complexity“
Suchergebnisse
263 Treffer
-
Approximate Degree Lower Bounds for Oracle Identification Problems
-
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree
-
Reducing Tarski to Unique Tarski (In the Black-Box Model)
-
Unitary Property Testing Lower Bounds by Polynomials
-
Quantum Algorithms and the Power of Forgetting
-
Certificate Games
-
Complexity of Fault Tolerant Query Complexity
-
When You Come at the King You Best Not Miss
-
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
-
Counting and Sampling from Substructures Using Linear Algebraic Queries
-
Lifting with Inner Functions of Polynomial Discrepancy
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
-
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms
-
On Converses to the Polynomial Method
-
Quantum Algorithms for Learning a Hidden Graph
-
Tolerant Bipartiteness Testing in Dense Graphs
-
An Almost Optimal Algorithm for Unbounded Search with Noisy Information
-
Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk)
-
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle
-
Mapping Networks via Parallel kth-Hop Traceroute Queries