Pages that link to "Item:Q1887139"
From MaRDI portal
The following pages link to The dimensions of individual strings and sequences (Q1887139):
Displaying 50 items.
- 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: on fair sharing of multiple resources (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: homomorphic encryption for restricted computations (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)
- Mutual dimension (Q2832303) (← links)
- A Correspondence Principle for Exact Constructive Dimension (Q2904465) (← links)
- The dimension of ergodic random sequences (Q2904794) (← links)
- Bounded Pushdown Dimension vs Lempel Ziv Information Density (Q2970951) (← links)
- Representation of maxitive measures: An overview (Q2986047) (← links)
- Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension (Q3088288) (← links)
- Relative Kolmogorov complexity and geometry (Q3107351) (← links)
- FRIEZES, STRINGS AND CLUSTER VARIABLES (Q3116833) (← links)
- Who Asked Us? How the Theory of Computing Answers Questions about Analysis (Q3297823) (← links)
- Calibrating Randomness (Q3412463) (← links)
- Effective Dimensions and Relative Frequencies (Q3507438) (← links)
- Effective Strong Dimension in Algorithmic Information and Computational Complexity (Q3507516) (← links)
- Dimensions of Points in Self-similar Fractals (Q3511330) (← links)
- Connectivity properties of dimension level sets (Q3528144) (← links)
- ALGORITHMS FOR FRACTAL DIMENSION CALCULATION (Q3532441) (← links)
