Equivalence of measures of complexity classes
From MaRDI portal
Publication:5048952
Recommendations
Cites work
- scientific article; zbMATH DE number 4054673 (Why is no real title available?)
- scientific article; zbMATH DE number 3678157 (Why is no real title available?)
- scientific article; zbMATH DE number 1261804 (Why is no real title available?)
- scientific article; zbMATH DE number 3446413 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
- A unified approach to the definition of random sequences
- Almost every set in exponential time is P-bi-immune
- Almost everywhere high nonuniform complexity
- Cook versus Karp-Levin: Separating completeness notions if NP is not small
- Families of recursive predicates of measure zero
- Fine separation of average time complexity classes
- Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung
- Measure, Stochasticity, and the Density of Hard Languages
- Observations on measure and lowness for \(\Delta_2^{\mathrm{P}}\) (extended abstract)
- On equivalence of infinite product measures
- Process complexity and effective random tests
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The Complexity and Distribution of Hard Problems
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
- Weakly Hard Problems
- Weakly complete problems are not rare
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(6)
This page was built for publication: Equivalence of measures of complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048952)