zweidimensionales bewegtes Bild
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
- Location
-
Hannover TIB
- Extent
-
1390MB, 01:33:37:06 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
VIRTUAL RESEARCH SCHOOL - French Computer Algebra Days ; (Jan. 2021)
- Keyword
-
Castelnuovo-Mumford regularity
Gröbner bases
solving degree
lest fall degree
- Event
-
Veröffentlichung
- (who)
-
Centre International de Rencontres Mathématiques (CIRM)
- (when)
-
2021-01-01
- Contributor
-
Gorla, Elisa
Hennenfent, Guillaume (Filmmaker)
Bardet, Magali (Organisation)
Busé, Laurent (Organisation)
Koseleff, Pierre-Vincent (Organisation)
Vaccon, Tristan (Organisation)
- DOI
-
10.5446/57562
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- 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)
Time of origin
- 2021-01-01
Other Objects (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