- Conference Article
39
- 10.1145/2442829.2442843
Solving polynomial systems over finite fields
- Jul 22, 2012
- Luk Bettale + 2 more +2
International audience
We present a randomized algorithm that takes as input a prime number p, and an algebraic set (represented by a system of polynomials) over the finite field Fp, and counts approximately the number of Fp-rational points in the set. For a fixed number of variables, the algorithm runs in random polynomial time with parallel complexity polylogarithmic in the input parameters (number of input polynomials, their maximum degree, and the prime p), using a polynomial number of processors. However, the degree of the polynomial bound on the running time grows sharply with the number of variables. A combinatorial analysis of the algorithm also shows that, when p is sufficiently large, a good approximate count is represented by Np D , where D is the highest possible dimension of an Fp-irreducible subvariety of the input defined over Fp, and N is the number of such distinct subvarieties. In addition, the algorithm computes these two numbers efficiently. It is also applied to obtain an asymptotic lower bound counting result in the case when an algebraic set defined over ℚ is reduced mod p, where p goes to infinity.
Solving polynomial systems over finite fields
International audience
Absolute primality of polynomials is decidable in random polynomial time in the number of variables
Let F be a n-variate polynomial with deg F = d over an infinite field k0. Absolute primality of F can be decided randomly in time polynomial in n and exponential in d5 and determinalistically in time exponential in d6 + n2 d3.
Read moreDeterministic polynomial factoring over finite fields: A uniform approach via [formula omitted]-schemes
Deterministic polynomial factoring over finite fields: A uniform approach via [formula omitted]-schemes
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
We present a randomized algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the polynomial equations. Our algorithm works in time polynomial in the number of equations and the logarithm of the size of the field, whenever the degree of the polynomial equations is constant. As a consequence we design polynomial time quantum algorithms for two algebraic hidden structure problems: for the hidden subgroup problem in certain semidirect product \(p\)-groups of constant nilpotency class, and for the multi-dimensional univariate hidden polynomial graph problem when the degree of the polynomials is constant.
Read moreReinterpretation with Adeles and Ideles
This chapter develops tools for a more penetrating study of algebraic number theory than was possible in Chapter V and concludes by formulating two of the main three theorems of Chapter V in the modern setting of “adeles” and “ideles” commonly used in the subject.Sections 1–5 introduce discrete valuations, absolute values, and completions for fields, always paying attention to implications for number fields and for certain kinds of function fields. Section 1 contains a prototype for all these notions in the construction of the fieldQp of p-adic numbers formed out of the rationals. Discrete valuations in Section 2 are a generalization of the order-of-vanishing function about a point in the theory of one complex variable. Absolute values in Section 3 are real-valued multiplicative functions that give a metric on a field, and the pair consisting of a field and an absolute value is called a valued field. Inequivalent absolute values have a certain independence property that is captured by the Weak Approximation Theorem. Completions in Section 4 are functions mapping valued fields into their metric-space completions. Section 5 concerns Hensel’s Lemma, which in its simplest form allows one to lift roots of polynomials over finite prime fields Fp to roots of corresponding polynomials over p-adic fields Qp.Section 6 contains the main theorem for investigating the fundamental question of how prime ideals split in extensions. Let K be a finite separable extension of a field F, let R be a Dedekind domain with field of fractions F, and let T be the integral closure of R in K. The question concerns the factorization of an ideal pT in T when p is a nonzero prime ideal in R. If Fp denotes the completion of F with respect to p, the theorem explains how the tensor product K ⊗F Fp splits uniquely as a direct sum of completions of valued fields. The theorem in effect reduces the question of the splitting of pT in T to the splitting of Fp in a complete field in which only one of the prime factors of pT plays a role.Section 7 is a brief aside mentioning additional conclusions one can draw when the extension K/F is a Galois extension.Section 8 applies the main theorem of Section 6 to an analysis of the different of K/F and ultimately to the absolute discriminant of a number field. With the new sharp tools developed in the present chapter, including a Strong Approximation Theorem that is proved in Section 8, a complete proof is given for the Dedekind Discriminant Theorem; only a partial proof had been accessible in Chapter V.Sections 9–10 specialize to the case of number fields and to function fields that are finite separable extensions of Fq (X), where Fq is a finite field. The adele ring and the idele group are introduced for each of these kinds of fields, and it is shown how the original field embeds discretely in the adeles and how the multiplicative group embeds discretely in the ideles. The main theorems are compactness theorems about the quotient of the adeles by the embedded field and about the quotient of the normalized ideles by the embedded multiplicative group. Proofs are given only for number fields. In the first case the compactness encodes the Strong Approximation Theorem of Section 8 and the Artin product formula of Section 9. In the second case the compactness encodes both the finiteness of the class number and the Dirichlet Unit Theorem.KeywordsPrime IdealValuation RingBasic AlgebraDedekind DomainFractional IdealThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Read moreOn the complexity of parallel parsing of general context-free languages
On the complexity of parallel parsing of general context-free languages
Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC
In the spirit of A. Cobham's algebraic, machine-independent characterization of the collection FP of polynomial time computable functions in [Cob65] (see also [Ros84]), we characterize the collection AC O of functions computable with uniform constant depth polynomial size circuits and the collection NC of functions computable in polylogarithmic time with a polynomial number of processors on a parallel random access machine (PRAM). From these characterizations, we obtain level-by-level characterizations of the intermediate classes AC k and NC k . The class AC O is the closure of certain simple initial functions under composition and a variant of bounded primitive recursion called concatenation recursion on notation. The class NC is obtained from the same initial functions by adding a second variant of bounded primitive recursion called weak bounded recursion on notation. Thus, well known parallel complexity classes are characterized in a machine-independent manner using sequential operations. As a corollary, one can give Backus-Naur for a sequential programming language fragment of Pascal which "captures" the parallel complexity class NC, in the sense that functions, which can be programmed in this fragment, are exactly those which are computable in polylogarithmic time with a polynomial number of processors on a PRAM Note that this latter result is much more than a simple serialization of parallel code.
Read moreApproximate counting, the Lovasz local lemma, and inference in graphical models
In this paper we introduce a new approach for approximately counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula Ф when the width is logarithmic in the maximum degree. This closes an exponential gap between the known upper and lower bounds. Moreover our algorithm extends straightforwardly to approximate sampling, which shows that under Lovasz Local Lemma-like conditions it is not only possible to find a satisfying assignment, it is also possible to generate one approximately uniformly at random from the set of all satisfying assignments. Our approach is a significant departure from earlier techniques in approximate counting, and is based on a framework to bootstrap an oracle for computing marginal probabilities on individual variables. Finally, we give an application of our results to show that it is algorithmically possible to sample from the posterior distribution in an interesting class of graphical models.
Read moreFast arithmetics in Artin–Schreier towers over finite fields
Fast arithmetics in Artin–Schreier towers over finite fields
Lower central series of a free associative algebra over the integers and finite fields
Lower central series of a free associative algebra over the integers and finite fields
The Hurwitz curve over a finite field and its Weierstrass points for the morphism of lines
The Hurwitz curve over a finite field and its Weierstrass points for the morphism of lines
Constructing Isogenies between Elliptic Curves Over Finite Fields
Let E1 and E2 be ordinary elliptic curves over a finite field Fp such that #E1(Fp) = #E2(Fp). Tate's isogeny theorem states that there is an isogeny from E1 to E2 which is defined over Fp. The goal of this paper is to describe a probabilistic algorithm for constructing such an isogeny.The algorithm proposed in this paper has exponential complexity in the worst case. Nevertheless, it is efficient in certain situations (that is, when the class number of the endomorphism ring is small). The significance of these results to elliptic curve cryptography is discussed.
Read moreFast arithmetics in artin-schreier towers over finite fields
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp-X-α. Following Cantor and Couveignes, we give algorithms with quasi-linear time complexity for arithmetic operations in such towers. As an application, we present an implementation of Couveignes' algorithm for computing isogenies between elliptic curves using the p-torsion.
Read moreAn O(log N) Parallel Time Exact Hidden-Line Algorithm
Parallel algorithms are given for the exact solution of the hidden-line problem. Most of the parallel algorithms proposed for visibility problems in the literature give approximate solutions. and thus cannot yield an upper bound on the complexity of the particular problem. The first algorithm proposed here is worth mentioning not only for its simplicity. but also from a practical point of view: a speed up of a factor P is achieved by using P processors. 1≤P≤N, where N is the number of edges used to describe a polygonal scene. Additionally. the problem of aliasing inherent with approximation methods is avoided. The significance of the second algorithm, which is based on the first one, is mainly on the theoretical level: it is used to establish the parallel complexity of the hidden-line problem. The sequential complexity of this problem has recently been proved to be Θ(N2), and now we can prove that in the parallel case the problem is in the complexity class NC, i.e., it can be solved in time polynomial in log N by using a number of processors polynomial in N, assuming any reasonable model of parallel computation. More particularly, an O (log N) parallel time solution is given which cannot be further improved even if arbitrarily many processors of a concurrent read, exclusive write parallel RAM model are available.
Read moreThe art gallery problem is ∃ ℝ-complete
We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classic problem in computational geometry, introduced in 1973 by Victor Klee. Given a simple polygon P and an integer k, the goal is to decide if there exists a set G of k guards within P such that every point p ∈ P is seen by at least one guard g∈ G. Each guard corresponds to a point in the polygon P, and we say that a guard g sees a point p if the line segment pg is contained in P. The art gallery problem has stimulated extensive research in geometry and in algorithms. However, the complexity status of the art gallery problem has not been resolved. It has long been known that the problem is NP-hard, but no one has been able to show that it lies in NP. Recently, the computational geometry community became more aware of the complexity class ∃ ℝ, which has been studied earlier by other communities. The class ∃ ℝ consists of problems that can be reduced in polynomial time to the problem of deciding whether a system of polynomial equations with integer coefficients and any number of real variables has a solution. It can be easily seen that NP ⊆ ∃ ℝ. We prove that the art gallery problem is ∃ ℝ-complete, implying that (1) any system of polynomial equations over the real numbers can be encoded as an instance of the art gallery problem, and (2) the art gallery problem is not in the complexity class NP unless NP=∃ ℝ. As an illustration of our techniques, we can show that for every compact semi-algebraic set S⊂ [0,1]2 there exists a polygon with rational coordinates that enforces one of the guards to be at any position p∈ S, in any optimal guarding. As a corollary of our construction, we prove that for any real algebraic number α there is an instance of the art gallery problem where one of the coordinates of the guards equals α in any guard set of minimum cardinality. That rules out many natural geometric approaches to the problem, as it shows that any approach based on constructing a finite set of candidate points for placing guards has to include points with coordinates being roots of polynomials with arbitrary degree. In the ∃ ℝ-hardness proof for the art gallery problem we introduce a new ∃ ℝ-complete problem ETR-INV. We believe that this problem is of independent interest, as it can be used to obtain ∃ ℝ-hardness proofs for other problems. In particular, ETR-INV has been very recently used to prove ∃ ℝ-hardness of other geometric problems.
Read more