zweidimensionales bewegtes Bild
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
- Standort
-
Hannover TIB
- Umfang
-
1390MB, 01:33:37:06 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
VIRTUAL RESEARCH SCHOOL - French Computer Algebra Days ; (Jan. 2021)
- Schlagwort
-
Castelnuovo-Mumford regularity
Gröbner bases
solving degree
lest fall degree
- Ereignis
-
Veröffentlichung
- (wer)
-
Centre International de Rencontres Mathématiques (CIRM)
- (wann)
-
2021-01-01
- Beteiligte Personen und Organisationen
-
Gorla, Elisa
Hennenfent, Guillaume (Filmmaker)
Bardet, Magali (Organisation)
Busé, Laurent (Organisation)
Koseleff, Pierre-Vincent (Organisation)
Vaccon, Tristan (Organisation)
- DOI
-
10.5446/57562
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Gorla, Elisa
- Hennenfent, Guillaume (Filmmaker)
- Bardet, Magali (Organisation)
- Busé, Laurent (Organisation)
- Koseleff, Pierre-Vincent (Organisation)
- Vaccon, Tristan (Organisation)
- Centre International de Rencontres Mathématiques (CIRM)
Entstanden
- 2021-01-01
Ähnliche Objekte (12)
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Groebner bases, coding, and cryptography
Monomial Representations for Gröbner Bases Computations
Complexity of pushdown computations
The Complexity of Cryptography
Computations on words and their complexity
Lecture 02 Post-Quantum Cryptography
Lecture 01 Post-Quantum Cryptography
Lecture 03 Post-Quantum Cryptography
Lecture 15 Post-Quantum Cryptography
Lecture 06 Post-Quantum Cryptography
Lecture 11 Post-Quantum Cryptography
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Groebner bases, coding, and cryptography
Monomial Representations for Gröbner Bases Computations
Complexity of pushdown computations
The Complexity of Cryptography
Computations on words and their complexity
Lecture 02 Post-Quantum Cryptography
Lecture 01 Post-Quantum Cryptography
Lecture 03 Post-Quantum Cryptography
Lecture 15 Post-Quantum Cryptography
Lecture 06 Post-Quantum Cryptography
Lecture 11 Post-Quantum Cryptography
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Groebner bases, coding, and cryptography
Monomial Representations for Gröbner Bases Computations
Complexity of pushdown computations
The Complexity of Cryptography
Computations on words and their complexity
Lecture 02 Post-Quantum Cryptography
Lecture 01 Post-Quantum Cryptography
Lecture 03 Post-Quantum Cryptography
Lecture 15 Post-Quantum Cryptography
Lecture 06 Post-Quantum Cryptography