84 lines
1.4 KiB
JSON
84 lines
1.4 KiB
JSON
{
|
|
"name": "Polynomial arithmetic and applications",
|
|
"order": 18,
|
|
"challenges": [
|
|
{
|
|
"id": "59a5801209a6acac5983b660",
|
|
"title": "Basic arithmetic",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b137",
|
|
"title": "Computing minimal polynomials in F[X]/(f)(I)",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b138",
|
|
"title": "Euclid's algorithm",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b139",
|
|
"title": "Computing modular inverses and Chinese remaindering",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b140",
|
|
"title": "Rational function reconstruction and applications",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
},
|
|
{
|
|
"id": "59a5801209a6acac5983b141",
|
|
"title": "Faster polynomial arithmetic",
|
|
"description": [
|
|
""
|
|
],
|
|
"challengeSeed": [
|
|
""
|
|
],
|
|
"tests": [
|
|
""
|
|
]
|
|
}
|
|
]
|
|
} |