Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (Q3297821): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Eric W. Allender / rank
Normal rank
 
Property / author
 
Property / author: Eric W. Allender / rank
 
Normal rank
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-030-41672-0_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3007294200 / 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: The new complexity landscape around circuit minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions to the set of random strings: The resource-bounded case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power from Random Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and circuit minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Circuit Size, Graph Isomorphism, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum oracle circuit size problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The non-hardness of approximating circuit size / 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: Kolmogorov complexity and degrees of tally sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational depth: Concept and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions to sets of low information content / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281491 / 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 Languages with Very High Space-Bounded Kolmogorov Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-Bounded Kolmogorov Complexity Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An excursion to the Kolmogorov random strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inference of optimal descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov characterizations of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-Completeness of the Minimum Circuit Size Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit minimization problem / 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: On the Complexity of Learning Minimum Time-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4727431 / 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: An introduction to Kolmogorov complexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak lower bounds on resource-bounded compression imply strong separations of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness magnification near state-of-the-art lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instance complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information-theoretic approach to time bounds for on-line computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational limitations on learning from examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum consistent DFA problem cannot be approximated within any polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithm and minimum circuit size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:59, 23 July 2024

scientific article
Language Label Description Also known as
English
Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
scientific article

    Statements

    Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity (English)
    0 references
    20 July 2020
    0 references
    Kolmogorov complexity
    0 references
    complexity theory
    0 references
    minimum circuit size problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers