scientific article; zbMATH DE number 1048036
From MaRDI portal
Publication:4348122
Recommendations
Cited in
(31)- Genericity and randomness over feasible probability measures
- Almost complete sets.
- Resource bounded randomness and computational complexity
- A stronger Kolmogorov zero-one law for resource-bounded measure
- Nondeterminisic sublinear time has measure 0 in P
- Nonuniform reductions and NP-completeness
- Resource-bounded martingales and computable Dowd-type generic sets
- Bounded truth table does not reduce the one-query tautologies to a random oracle
- Generic density and small span theorem
- Compressibility and resource bounded measure
- Subcomputable Schnorr randomness
- Quantitative aspects of speed-up and gap phenomena
- Axiomatizing resource bounds for measure
- Nonuniform reductions and NP-completeness
- scientific article; zbMATH DE number 1222581 (Why is no real title available?)
- scientific article; zbMATH DE number 1335897 (Why is no real title available?)
- scientific article; zbMATH DE number 1104167 (Why is no real title available?)
- scientific article; zbMATH DE number 1492083 (Why is no real title available?)
- Compressibility and resource bounded measure
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Schnorr randomness
- Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998
- On pseudorandomness and resource-bounded measure
- A note on measuring in P
- The size of SPP
- Comparing nontriviality for E and EXP
- Inseparability and strong hypotheses for disjoint NP pairs
- Random permutations in computational complexity
- An outer-measure approach for resource-bounded measure
- Turing's unpublished algorithm for normal numbers
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle?
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 Q4348122)
