Pages that link to "Item:Q1190985"
From MaRDI portal
The following pages link to Almost everywhere high nonuniform complexity (Q1190985):
Displaying 50 items.
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- Relative to a random oracle, P/poly is not measurable in EXP (Q294619) (← links)
- A separation of two randomness concepts (Q294630) (← links)
- Functions that preserve p-randomness (Q393087) (← links)
- A note on measuring in P (Q596092) (← links)
- The size of SPP (Q596117) (← links)
- Dimension, halfspaces, and the density of hard sets (Q649114) (← 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 nontriviality for E and EXP (Q693048) (← links)
- Inseparability and strong hypotheses for disjoint NP pairs (Q693061) (← links)
- Generalised and quotient models for random and/or~trees and application to satisfiability (Q727977) (← links)
- An outer-measure approach for resource-bounded measure (Q841624) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Martingale families and dimension in P (Q930913) (← links)
- Resource-bounded measure on probabilistic classes (Q963376) (← links)
- Gales suffice for constructive dimension (Q1007560) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
- Resource-bounded strong dimension versus resource-bounded category (Q1041791) (← links)
- On the relative sizes of learnable sets (Q1128667) (← links)
- Random languages for nonuniform complexity classes (Q1179458) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← 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)
- Completeness and weak completeness under polynomial-size circuits (Q1917077) (← links)
- Weakly complete problems are not rare (Q1918951) (← links)
- A zero-one SUBEXP-dimension law for BPP (Q1944915) (← links)
- Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
- Hard sets are hard to find (Q1961379) (← links)
