Avoiding simplicity is complex (Q693072): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some consequences of the existnce of pseudorandom generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding Simplicity Is Complex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power from 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: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / 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: Resource-Bounded Kolmogorov Complexity Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional Lower Bounds against Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating NE from Some Nonuniform Nondeterministic Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse sets in NP-P: EXPTIME versus NEXPTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: In search of an easy witness: Exponential time vs. probabilistic polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness conservation inequalities; information and independence in mathematical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank

Revision as of 22:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Avoiding simplicity is complex
scientific article

    Statements

    Avoiding simplicity is complex (English)
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    hitting sets
    0 references
    Kolmogorov complexity
    0 references
    complexity theory
    0 references
    \(\mathrm{Kt}\) complexity
    0 references
    \(\mathrm{KNt}\) complexity
    0 references

    Identifiers