Pages that link to "Item:Q1190985"
From MaRDI portal
The following pages link to Almost everywhere high nonuniform complexity (Q1190985):
Displayed 46 items.
- A note on measuring in P (Q596092) (← links)
- The size of SPP (Q596117) (← links)
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) (Q673644) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Martingale families and dimension in P (Q930913) (← links)
- Gales suffice for constructive dimension (Q1007560) (← links)
- On the relative sizes of learnable sets (Q1128667) (← links)
- Circuit size relative to pseudorandom oracles (Q1208410) (← links)
- On the size of classes with weak membership properties (Q1274925) (← links)
- Genericity and randomness over feasible probability measures (Q1275002) (← links)
- Computational depth and reducibility (Q1334655) (← links)
- Almost every set in exponential time is P-bi-immune (Q1349712) (← links)
- Genericity and measure for exponential time (Q1350990) (← links)
- An excursion to the Kolmogorov random strings (Q1362331) (← links)
- Measure on \(P\): Strength of the notion (Q1362904) (← links)
- Index sets and presentations of complexity classes (Q1366536) (← links)
- Normal numbers and sources for BPP (Q1391532) (← links)
- Resource bounded randomness and weakly complete problems (Q1392022) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- Almost complete sets. (Q1426448) (← links)
- Resource bounded randomness and computational complexity (Q1566703) (← links)
- Complete distributional problems, hard languages, and resource-bounded measure (Q1575682) (← links)
- The zero-one law holds for BPP (Q1575726) (← links)
- Weakly useful sequences (Q1776400) (← links)
- MAX3SAT is exponentially hard to approximate if NP has positive dimension. (Q1853564) (← links)
- Recursive computational depth. (Q1854307) (← links)
- A stronger Kolmogorov zero-one law for resource-bounded measure (Q1870565) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- Weakly complete problems are not rare (Q1918951) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
- Hard sets are hard to find (Q1961379) (← links)
- Upward separations and weaker hypotheses in resource-bounded measure (Q2465636) (← links)
- Generic density and small span theorem (Q2475804) (← links)
- Baire categories on small complexity classes and meager-comeager laws (Q2475805) (← links)
- Dimension, entropy rates, and compression (Q2495412) (← links)
- A note on dimensions of polynomial size circuits (Q2503295) (← links)
- Calibrating Randomness (Q3412463) (← links)
- Genericity, Randomness, and Polynomial-Time Approximations (Q4210154) (← links)
- On the robustness of ALMOST-$\mathcal {R}$ (Q4717048) (← links)
- Schnorr randomness (Q5311740) (← links)
- On the construction of effectively random sets (Q5311758) (← links)
- Strong Reductions and Isomorphism of Complete Sets (Q5458832) (← links)
- Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998 (Q5929910) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)