En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK
1

Meta-complexity - Lecture 2

Bookmarks Report an error
Multi angle
Authors : Kolokolova, Antonina (Author of the conference)
CIRM (Publisher )

Loading the player...

Abstract : Meta-complexity is the study of the complexity of computing hardness measures such as time-bounded versions of Kolmogorov complexity and circuit size. Here I will cover some results about complexity of computing these measures, and connections with learning theory and (time permititng) cryptography.

MSC Codes :
03D15 - Complexity of computation, See also {68Q15}
68Q25 - Analysis of algorithms and problem complexity
68Q32 - Computational learning theory

    Information on the Video

    Film maker : Hennenfent, Guillaume
    Language : English
    Available date : 15/04/2025
    Conference Date : 04/04/2025
    Subseries : Research School
    arXiv category : Computational Complexity ; Logic in Computer Science
    Mathematical Area(s) : Computer Science ; Logic and Foundations
    Format : MP4 (.mp4) - HD
    Video Time : 01:11:52
    Targeted Audience : Researchers ; Graduate Students ; Doctoral Students, Post-Doctoral Students
    Download : https://videos.cirm-math.fr/2025-04-04_Kolokolova_Part 2.mp4

Information on the Event

Event Title : Complexity as a kaleidoscope / Le kaleidoscope de la complexité
Event Organizers : Bredariol Grilo, Alex ; Fijalkow, Joanna ; Huiberts, Sophie ; Rezende, Susanna ; Seiller, Thomas
Dates : 31/03/2025 - 04/04/2025
Event Year : 2025
Event URL : https://conferences.cirm-math.fr/3225.html

Citation Data

DOI : 10.24350/CIRM.V.20341903
Cite this video as: Kolokolova, Antonina (2025). Meta-complexity - Lecture 2. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.20341903
URI : http://dx.doi.org/10.24350/CIRM.V.20341903

See Also

Bibliography



Imagette Video

Bookmarks Report an error