An upward measure separation theorem
- 22 April 1991
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 81 (1) , 127-135
- https://doi.org/10.1016/0304-3975(91)90320-2
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Algorithms and RandomnessTheory of Probability and Its Applications, 1988
- On the notion of infinite pseudorandom sequencesTheoretical Computer Science, 1986
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- Randomness conservation inequalities; information and independence in mathematical theoriesInformation and Control, 1984
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Families of recursive predicates of measure zeroJournal of Mathematical Sciences, 1976
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952