The following pages link to Dimension in Complexity Classes (Q4429684):
Displaying 50 items.
- Strict process machine complexity (Q403400) (← 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)
- Entropy rates and finite-state dimension (Q817815) (← links)
- Constructive dimension equals Kolmogorov complexity (Q835015) (← links)
- Kolmogorov-Loveland stochasticity and Kolmogorov complexity (Q968271) (← links)
- Complex network dimension and path counts (Q974738) (← links)
- Information measures for infinite sequences (Q974755) (← links)
- Pushdown dimension (Q995564) (← links)
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Resource-bounded strong dimension versus resource-bounded category (Q1041791) (← links)
- Fractal dimension and logarithmic loss unpredictability. (Q1401414) (← links)
- Mutual dimension and random sequences (Q1637218) (← links)
- Exact constructive and computable dimensions (Q1694005) (← links)
- Prediction and dimension (Q1780452) (← links)
- Effective Hausdorff dimension in general metric spaces (Q1787953) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- Finite-state dimension (Q1884962) (← links)
- The dimensions of individual strings and sequences (Q1887139) (← links)
- Compressibility and Kolmogorov complexity (Q1934957) (← links)
- A zero-one SUBEXP-dimension law for BPP (Q1944915) (← links)
- Dimension is compression (Q1946504) (← links)
- Nondeterminisic sublinear time has measure 0 in P (Q1999993) (← links)
- Thinking with notations: epistemic actions and epistemic activities in mathematical practice (Q2101897) (← links)
- Bounding the dimension of points on a line (Q2216115) (← links)
- Subcomputable Hausdorff function dimension (Q2235747) (← links)
- Hausdorff dimension and oracle constructions (Q2369006) (← links)
- Dimensions of Copeland-Erdös sequences (Q2381501) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Base invariance of feasible dimension (Q2444767) (← links)
- Finite-state dimension and real arithmetic (Q2461795) (← links)
- Partial bi-immunity, scaled dimension, and NP-completeness (Q2480744) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- A note on dimensions of polynomial size circuits (Q2503295) (← 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)
