Limits on the Computational Power of Random Strings (Q3012814): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W190215904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What can be efficiently reduced to the Kolmogorov-random strings? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power from Random Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the computational power of random strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Languages Reducible to Algorithmically Random Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on probability versus randomness with applications to complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robustness of ALMOST-$\mathcal {R}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Hardness vs. Randomness under Uniform Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Reducibility to the Kolmogorov Random Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness vs time: Derandomization under a uniform assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov entropy in the context of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness and average-case complexity via uniform reductions / rank
 
Normal rank

Latest revision as of 06:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Limits on the Computational Power of Random Strings
scientific article

    Statements

    Limits on the Computational Power of Random Strings (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2011
    0 references

    Identifiers