Pages that link to "Item:Q3507516"

The following pages link to Effective Strong Dimension in Algorithmic Information and Computational Complexity (Q3507516):

Displaying 50 items.

• Dimension spectra of random subfractals of self-similar fractals (Q400423) (← links)
• A divergence formula for randomness and dimension (Q616503) (← links)
• Dimension, halfspaces, and the density of hard sets (Q649114) (← links)
• Effective dimensions and relative frequencies (Q650901) (← links)
• Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
• Constructive dimension and Turing degrees (Q733739) (← links)
• Complex network dimension and path counts (Q974738) (← links)
• Information measures for infinite sequences (Q974755) (← links)
• Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
• Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
• Resource-bounded strong dimension versus resource-bounded category (Q1041791) (← links)
• Compressibility and Kolmogorov complexity (Q1934957) (← links)
• Dimension is compression (Q1946504) (← links)
• Dimension spectra of lines (Q2011669) (← links)
• KL-randomness and effective dimension under strong reducibility (Q2117810) (← links)
• Subcomputable Hausdorff function dimension (Q2235747) (← links)
• Base invariance of feasible dimension (Q2444767) (← links)
• Finite-state dimension and real arithmetic (Q2461795) (← links)
• Automatic Kolmogorov complexity, normality, and finite-state dimension revisited (Q2656172) (← links)
• The Kučera-Gács theorem revisited by Levin (Q2682931) (← 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)