scientific article; zbMATH DE number 1335892
From MaRDI portal
Publication:4258583
Recommendations
- A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
- Resource-bounded Kolmogorov complexity revisited
- Resource-bounded Kolmogorov complexity revisited
- A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
- Results on resource-bounded measure
- Restricted relativizations of probabilistic polynomial time
- Resource bounded randomness and weakly complete problems
- scientific article; zbMATH DE number 1555954
- On Resource-Bounded Versions of the van Lambalgen Theorem
Cited in
(7)- On Resource-Bounded Versions of the van Lambalgen Theorem
- A note on dimensions of polynomial size circuits
- Results on resource-bounded measure
- Observations on measure and lowness for \(\Delta_2^{\mathrm{P}}\) (extended abstract)
- Nondeterminisic sublinear time has measure 0 in P
- Dimension, entropy rates, and compression
- On small generators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258583)
