[Lecture Notes in Computer Science] Orders, Algorithms, and Applications Volume 831 || Intervals and orders: What comes after interval orders?
- 作者Bouchitté, Vincent; Morvan, Michel
- 文件大小961.40KB
- 发表时间1994
- DOI10.1007/bfb0019424
- 页码13-32
同作者推荐
Factoring polynomials using fewer random bitsEric Bach; Victor Shoup · 1990
Primality testing with fewer random bitsRené Peralta; Victor Shoup · Computational Complexity · 1993
OAEP ReconsideredVictor Shoup · Journal of Cryptology · 2002
Computing Frobenius maps and factoring polynomialsJoachim von zur Gathen; Victor Shoup · Computational Complexity · 1992
Smoothness and factoring polynomials over finite fieldsVictor Shoup · 1991
GNUC: A New Universal Composability FrameworkHofheinz, Dennis; Shoup, Victor · Journal of Cryptology · 2015
ground state of the lithium atomKing, Frederick W.; Shoup, Victor · Physical Review A · 1986
Searching for Primitive Roots in Finite FieldsVictor Shoup · Mathematics of Computation · 1992