20 results for “query complexity”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
Determining the stability of a linear system using quantum query complexity.
The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.
This paper introduces token complexity as a measure of the cost of sending queries to and receiving responses from a cluster of AI models.
This paper studies query abstraction in ontology-based data access using existential rules and certain answer semantics.
This paper settles the complexity of three sketching problems in graphs and distributions.
Computes class probabilities in block-independent disjoint probabilistic databases.
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…
This paper analyzes data-access cost in a memory hierarchy and shows it scales with the fourth root of data size, predicting scalability.
The authors improve the result of testing bipartiteness in bounded-degree graphs using random walks.