Factoring multivariate polynomials over algebraic number fields
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Let F 2 C[x; y; z] be a constant-degree polynomial, and let A; B; C subset of C be finite sets of size n. We show that F vanishes on at most O(n(11/6))points of the Cartesian product A X B X C, unless F has a special group-related form. This improves a the ...
Cryptosystems based on rank metric codes have been considered as an alternative to McEliece cryptosystems due to the relative difficulty of solving the rank syndrome decoding problem. Generic attacks have recently seen several improvements, notably in the ...
We derive a new upper bound on the diameter of a polyhedron , where . The bound is polynomial in and the largest absolute value of a sub-determinant of , denoted by . More precisely, we show that the diameter of is bounded by . If is bounded, then we show ...
In this paper, we define Euclidean minima for function fields and give some bound for this invariant. We furthermore show that the results are analogous to those obtained in the number field case. (C) 2013 The Authors. Published by Elsevier Inc. All rights ...
For~q a prime power, the discrete logarithm problem (DLP) in~\Fq consists in finding, for any g∈Fq× and h∈⟨g⟩, an integer~x such that gx=h. We present an algorithm for computing discrete logarithm ...
For q a prime power, the discrete logarithm problem (DLP) in Fq consists in finding, for any g∈Fq× and h∈⟨g⟩, an integer x such that gx=h. We present an algorithm for computing discrete log ...
Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...
We present novel Markov-type and Nikolskii-type inequalities for multivariate polynomials associated with arbitrary downward closed multi-index sets in any dimension. Moreover, we show how the constant of these inequalities changes, when the polynomial is ...
Let k be a global field of characteristic not 2, and let f is an element of k[X] be an irreducible polynomial. We show that a non-degenerate quadratic space has an isometry with minimal polynomial f if and only if such an isometry exists over all the compl ...
For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k >= 2, there is a polynomial-time algorithm that, for a 1-connected topological space X given as a f ...
