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.

Convex hulls of random order types: Label: en
On the need for large quantum depth: Label: en
The complexity of gradient descent: CLS = PPAD \(\cap\) pls: Label: en
Minimizing convex functions with rational minimizers: Label: en
OptORAMa: Optimal oblivious RAM: Label: en
Directed shortest paths via approximate cost balancing: Label: en
On the descriptive complexity of temporal constraint satisfaction problems: Label: en
Whole-grain Petri nets and processes: Label: en
Generative Datalog with continuous distributions: Label: en
Edge-weighted online bipartite matching: Label: en
Deterministic document exchange protocols and almost optimal binary codes for edit errors: Label: en
Nearly optimal pseudorandomness from hardness: Label: en
Adversarially robust streaming algorithms via differential privacy: Label: en
Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium: Label: en
Adversarial bandits with knapsacks: Label: en
Properly learning decision trees in almost polynomial time: Label: en
The effectiveness of lloyd-type methods for the k-means problem: Label: en
Iterative Procedures for Nonlinear Integral Equations: Label: en
Oracle Separation of BQP and PH: Label: en
Exponentially Faster Shortest Paths in the Congested Clique: Label: en
Private and Online Learnability Are Equivalent: Label: en
Foundations of Differentially Oblivious Algorithms: Label: en
Optimal Short-Circuit Resilient Formulas: Label: en
Beyond Natural Proofs: Hardness Magnification and Locality: Label: en
Anonymous Shared Memory: Label: en
Gradual System F: Label: en
Independence in Infinite Probabilistic Databases: Label: en
Two-round Multiparty Secure Computation from Minimal Assumptions: Label: en
QCSP Monsters and the Demise of the Chen Conjecture: Label: en
Decentralized Asynchronous Crash-resilient Runtime Verification: Label: en
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning: Label: en
An Improved Bound for Weak Epsilon-nets in the Plane: Label: en
SPARKs: Succinct Parallelizable Arguments of Knowledge: Label: en
Counting Subgraphs in Degenerate Graphs: Label: en
Enumeration for FO Queries over Nowhere Dense Graphs: Label: en
The Limitations of Optimization from Samples: Label: en
Information Acquisition Under Resource Limitations in a Noisy Environment: Label: en
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes: Label: en
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring: Label: en
Some Programming Techniques for the ERMETH: Label: en
Convex separable optimization is not much harder than linear optimization: Label: en
Playing Mastermind With Many Colors: Label: en
An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions: Label: en
Function Evaluation in Unnormalized Arithmetic: Label: en
An Evaluation of Runge-Kutta Type Methods for Higher Order Differential Equations: Label: en
Generalized Inverse Computations Using the Gradient Projection Method: Label: en
Mechanized Indexing Methods and Their Testing: Label: en
Multivariable Curve Interpolation: Label: en
A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory: Label: en
An Algorithm for Minimax Polynomial Curve-Fitting of Discrete Data: Label: en