Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Quantum and classical query complexities of local search are polynomially related: Label: en
A conjecture about polynomial time computable lattice-lattice functions: Label: en
Counting complexity classes for numeric computations II: Label: en
Lower bounds for local search by quantum arguments: Label: en
A new family of Cayley expanders (?): Label: en
Better extractors for better codes?: Label: en
Derandomizing homomorphism testing in general groups: Label: en
Boosted sampling: Label: en
The difficulty of testing for isomorphism against a graph that is given in advance: Label: en
Sublinear algorithms for testing monotone and unimodal distributions: Label: en
Algorithms for dynamic geometric problems over data streams: Label: en
Multi-processor scheduling to minimize flow time with ε resource augmentation: Label: en
Network games: Label: en
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem: Label: en
The two possible values of the chromatic number of a random graph: Label: en
Sharp thresholds For monotone properties in random geometric graphs: Label: en
Approximate max-integral-flow/min-multicut theorems: Label: en
(Almost) tight bounds and existence theorems for confluent flows: Label: en
The spending constraint model for market equilibrium: Label: en
Auction algorithms for market equilibrium: Label: en
The quantum adiabatic optimization algorithm and local minima: Label: en
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus: Label: en
Finding paths and cycles of superpolylogarithmic length: Label: en
An approximate König's theorem for edge-coloring weighted bipartite graphs: Label: en
Primal-dual algorithms for deterministic inventory problems: Label: en
Typical properties of winners and losers in discrete optimization: Label: en
A simple polynomial-time rescaling algorithm for solving linear programs: Label: en
Completeness in two-party secure computation: Label: en
New notions of security: Label: en
Multilinear formulas and skepticism of quantum computing: Label: en
Graph entropy and quantum sorting problems: Label: en
Multi-linear formulas for permanent and determinant are of super-polynomial size: Label: en
Depth through breadth, or why should we attend talks in other areas?: Label: en
Using mixture models for collaborative filtering: Label: en
A decentralized algorithm for spectral analysis: Label: en
Lower bounds for linear degeneracy testing: Label: en
Lower bounds for dynamic connectivity: Label: en
Collective asynchronous reading with polylogarithmic worst-case overhead: Label: en
Hit-and-run from a corner: Label: en
Isotopic implicit surface meshing: Label: en
On coresets for k-means and k-median clustering: Label: en
Bypassing the embedding: Label: en
Low distortion maps between point sets: Label: en
Batch codes and their applications: Label: en
Bounded-concurrent secure multi-party computation with a dishonest majority: Label: en
Expander flows, geometric embeddings and graph partitioning: Label: en
Linear FPT reductions and computational lower bounds: Label: en
Visibly pushdown languages: Label: en
Using nondeterminism to amplify hardness: Label: en
A fully dynamic reachability algorithm for directed graphs with an almost linear update time: Label: en