Pages that link to "Item:Q3627277"
From MaRDI portal
The following pages link to The Complexity of Forecast Testing (Q3627277):
Displaying 41 items.
- Testing theories with learnable and predictive representations (Q617673) (← links)
- Nonmanipulable Bayesian testing (Q643273) (← links)
- On universal algorithms for adaptive forecasting (Q764391) (← links)
- A nonmanipulable test (Q1020990) (← links)
- On comparison of experts (Q2278913) (← links)
- Merging and testing opinions (Q2510825) (← links)
- Learning hurdles for sleeping experts (Q2826040) (← links)
- Restriction access (Q2826041) (← links)
- Mechanism design with approximate valuations (Q2826042) (← links)
- Quantum strategic game theory (Q2826043) (← links)
- The curse of simultaneity (Q2826044) (← links)
- No justified complaints (Q2826045) (← links)
- From randomizing polynomials to parallel algorithms (Q2826046) (← links)
- Practical verified computation with streaming interactive proofs (Q2826047) (← links)
- Paging for multi-core shared caches (Q2826048) (← links)
- Noise vs computational intractability in dynamics (Q2826049) (← links)
- Distribution free evolvability of polynomial functions over all convex loss functions (Q2826050) (← links)
- Algorithms on evolving graphs (Q2826051) (← links)
- Towards deterministic tree code constructions (Q2826052) (← links)
- Linear time decoding of regular expander codes (Q2826053) (← links)
- List decoding subspace codes from insertions and deletions (Q2826055) (← links)
- Bounds on locally testable codes with unique tests (Q2826056) (← links)
- Approximately optimal mechanism design via differential privacy (Q2826057) (← links)
- Fairness through awareness (Q2826058) (← links)
- Dynamics of prisoner's dilemma and the evolution of cooperation on networks (Q2826059) (← links)
- Crowdsourced Bayesian auctions (Q2826060) (← links)
- Super-polynomial quantum speed-ups for boolean evaluation trees with hidden structure (Q2826061) (← links)
- Quantum interactive proofs with weak error bounds (Q2826062) (← links)
- Quantum money from knots (Q2826064) (← links)
- (Leveled) fully homomorphic encryption without bootstrapping (Q2826066) (← links)
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again (Q2826067) (← links)
- Targeted malleability (Q2826068) (← links)
- Sherali-Adams relaxations and indistinguishability in counting logics (Q2826069) (← links)
- Graph densification (Q2826070) (← links)
- Spectral sparsification via random spanners (Q2826071) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- On persistent homotopy, knotted complexes and the Alexander module (Q2826074) (← links)
- Gadgets and anti-gadgets leading to a complexity dichotomy (Q2826076) (← links)
- On beating the hybrid argument (Q2826078) (← links)
- Linear programming, width-1 CSPs, and robust satisfaction (Q2826079) (← links)
- Marginal hitting sets imply super-polynomial lower bounds for permanent (Q2826080) (← links)
