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.

Zero-knowledge against quantum attacks: Label: en
Limitations of quantum coset states for graph isomorphism: Label: en
Online trading algorithms and robust option pricing: Label: en
An efficient algorithm for solving word equations: Label: en
Pseudorandom walks on regular digraphs and the RL vs. L problem: Label: en
Lattice problems and norm embeddings: Label: en
On the fourier tails of bounded functions over the discrete cube: Label: en
A polynomial quantum algorithm for approximating the Jones polynomial: Label: en
Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: Label: en
Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs: Label: en
Linear time low tree-width partitions and algorithmic consequences: Label: en
Graph partitioning using single commodity flows: Label: en
Finding small balanced separators: Label: en
Can every randomized algorithm be derandomized?: Label: en
Hardness of approximate two-level logic minimization and PAC learning with membership queries: Label: en
Clique-width minimization is NP-hard: Label: en
Conditional hardness for approximate coloring: Label: en
The distance trisector curve: Label: en
Building triangulations using ε-nets: Label: en
A quasi-polynomial time approximation scheme for minimum weight triangulation: Label: en
Local zero knowledge: Label: en
Zero knowledge with efficient provers: Label: en
Advances in metric embedding theory: Label: en
Graph limits and parameter testing: Label: en
A combinatorial characterization of the testable graph properties: Label: en
The PCP theorem by gap amplification: Label: en
Time-space trade-offs for predecessor search: Label: en
Finding a maximum weight triangle in n ^3-Δ time, with applications: Label: en
New approximation guarantee for chromatic number: Label: en
Near-optimal algorithms for unique games: Label: en
Pricing for fairness: Label: en
Fast leader-election protocols with bounded cheaters' edge: Label: en
Byzantine agreement in the full-information model in O(log n) rounds: Label: en
Time-space tradeoffs for implementations of snapshots: Label: en
Optimal phylogenetic reconstruction: Label: en
The DLT priority sampling is essentially optimal: Label: en
Counting independent sets up to the tree threshold: Label: en
On the solution-space geometry of random constraint satisfaction problems: Label: en
Private approximation of search problems: Label: en
Information-theoretically secure protocols and security under composition: Label: en
Black-box constructions for secure computation: Label: en
The effect of collusion in congestion games: Label: en
New trade-offs in cost-sharing mechanisms: Label: en
The complexity of computing a Nash equilibrium: Label: en
Reducibility among equilibrium problems: Label: en
A randomized polynomial-time simplex algorithm for linear programming: Label: en
On maximizing welfare when utility functions are subadditive: Label: en
The Santa Claus problem: Label: en
Sub-constant error low degree test of almost-linear size: Label: en
Gowers uniformity, influence of variables, and PCPs: Label: en