Almost everywhere high nonuniform complexity (Q1190985): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Some consequences of the existnce of pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and degrees of tally sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with small generalized Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of recursive predicates of measure zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation times of NP sets of different densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Observations about the Randomness of Hard Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit-size lower bounds and non-reducibility to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of infinite pseudorandom sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: One way functions and pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3249579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Category and Measure in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom sources for BPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity oscillations in infinite binary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to the definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can an individual sequence of zeros and ones be random? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Mises' definition of random sequences reconsidered / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of information extraction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:11, 16 May 2024

scientific article
Language Label Description Also known as
English
Almost everywhere high nonuniform complexity
scientific article

    Statements

    Almost everywhere high nonuniform complexity (English)
    0 references
    0 references
    27 September 1992
    0 references
    lower bounds
    0 references
    circuit-size complexity
    0 references
    nonuniform complexities
    0 references
    uniform complexity classes
    0 references
    pseudorandom sequences
    0 references
    selective Kolmogorov complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers