84 lines
1.5 KiB
JSON
84 lines
1.5 KiB
JSON
{
|
|
"name": "Algorithms for finite fields",
|
|
"order": 22,
|
|
"challenges": [
|
|
{
|
|
"id": "59a5801209a6acac5983b663",
|
|
"title": "Tests for and constructing irreducible polynomials",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b153",
|
|
"title": "Computing minimal polynomials in F[X]/(f)(III)",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b154",
|
|
"title": "Factoring polynomials: square-free decomposition",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b155",
|
|
"title": "Factoring polynomials: the Cantor-Zassenhaus algorithm",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b156",
|
|
"title": "Factoring polynomials: Berlekamp's algorithm",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b157",
|
|
"title": "Deterministic factorization algorithms",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
}
|
|
]
|
|
} |