Recommendations
- Category and Measure in Complexity Classes
- Resource-bounded measure on probabilistic classes
- Upward separations and weaker hypotheses in resource-bounded measure
- scientific article; zbMATH DE number 1346358
- scientific article; zbMATH DE number 1500508
- Martingale families and dimension in P
- A stronger Kolmogorov zero-one law for resource-bounded measure
- scientific article; zbMATH DE number 1335897
- Logical Approaches to Computational Barriers
- Relative to a random oracle, NP is not small
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 3988704 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3446413 (Why is no real title available?)
- scientific article; zbMATH DE number 3190627 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A formal theory of inductive inference. Part II
- Algorithms and Randomness
- Category and Measure in Complexity Classes
- Comparing complexity classes
- Computation times of NP sets of different densities
- Computational Complexity of Probabilistic Turing Machines
- Families of recursive predicates of measure zero
- Hardness vs randomness
- On the Length of Programs for Computing Finite Binary Sequences
- On the notion of infinite pseudorandom sequences
- Randomness conservation inequalities; information and independence in mathematical theories
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
Cited in
(3)
This page was built for publication: An upward measure separation theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808696)
