Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Système polynomial avec erreurs"'
Autor:
Chakraborty, Olive
Publikováno v:
Cryptography and Security [cs.CR]. Sorbonne Université, 2020. English
Polynomial system solving is one of the oldest and most important problems in computational mathematics and has many applications in computer science. It is intrinsically a hard problem with complexity at least single exponential in the number of var
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::e93e8c1c26fd50f38f3a72a9de948ca2
https://tel.archives-ouvertes.fr/tel-03135217/file/Thesis_Olive_TEL_HAL.pdf
https://tel.archives-ouvertes.fr/tel-03135217/file/Thesis_Olive_TEL_HAL.pdf
Autor:
Chakraborty, Olive
Publikováno v:
Cryptography and Security [cs.CR]. Sorbonne Université, 2020. English. ⟨NNT : 2020SORUS283⟩
Polynomial system solving is one of the oldest and most important problems incomputational mathematics and has many applications in computer science. Itis intrinsically a hard problem with complexity at least single exponential in the number of varia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3c55b308df24f598c9a179d1100b5c23
https://tel.archives-ouvertes.fr/tel-03460923v2/document
https://tel.archives-ouvertes.fr/tel-03460923v2/document
Autor:
Chakraborty, Olive
Publikováno v:
Cryptography and Security [cs.CR]. Sorbonne Université, 2020. English
Polynomial system solving is one of the oldest and most important problems in computational mathematics and has many applications in computer science. It is intrinsically a hard problem with complexity at least single exponential in the number of var
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::e93e8c1c26fd50f38f3a72a9de948ca2
https://tel.archives-ouvertes.fr/tel-03135217/file/Thesis_Olive_TEL_HAL.pdf
https://tel.archives-ouvertes.fr/tel-03135217/file/Thesis_Olive_TEL_HAL.pdf