Entity usage
From MaRDI portal
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 39 results in range #1 to #39.
- Multicommodity flows and cuts in polymatroidal networks: Label: en
- Quantum rejection sampling: Label: en
- Marginal hitting sets imply super-polynomial lower bounds for permanent: Label: en
- Linear programming, width-1 CSPs, and robust satisfaction: Label: en
- On beating the hybrid argument: Label: en
- Gadgets and anti-gadgets leading to a complexity dichotomy: Label: en
- Compressed matrix multiplication: Label: en
- On persistent homotopy, knotted complexes and the Alexander module: Label: en
- On the degree of univariate polynomials over the integers: Label: en
- Spectral sparsification via random spanners: Label: en
- Graph densification: Label: en
- Sherali-Adams relaxations and indistinguishability in counting logics: Label: en
- Targeted malleability: Label: en
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again: Label: en
- (Leveled) fully homomorphic encryption without bootstrapping: Label: en
- Quantum money from knots: Label: en
- Quantum interactive proofs with weak error bounds: Label: en
- Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure: Label: en
- Crowdsourced Bayesian auctions: Label: en
- Dynamics of prisoner's dilemma and the evolution of cooperation on networks: Label: en
- Fairness through awareness: Label: en
- Approximately optimal mechanism design via differential privacy: Label: en
- Bounds on locally testable codes with unique tests: Label: en
- List decoding subspace codes from insertions and deletions: Label: en
- Linear time decoding of regular expander codes: Label: en
- Towards deterministic tree code constructions: Label: en
- Algorithms on evolving graphs: Label: en
- Distribution free evolvability of polynomial functions over all convex loss functions: Label: en
- Noise vs computational intractability in dynamics: Label: en
- Paging for multi-core shared caches: Label: en
- Practical verified computation with streaming interactive proofs: Label: en
- From randomizing polynomials to parallel algorithms: Label: en
- No justified complaints: Label: en
- The curse of simultaneity: Label: en
- Quantum strategic game theory: Label: en
- Mechanism design with approximate valuations: Label: en
- Restriction access: Label: en
- Learning hurdles for sleeping experts: Label: en
- High-confidence predictions under adversarial uncertainty: Label: en