pages151-160. 178KB Jun 04 2011 12:06:58 AM
Teks penuh
Garis besar
Dokumen terkait
For in- stance, the famous classes P and NP are the first two in the tower of com- plexity classes, if we consider the polynomial-time hierarchy.. And we know that the proof of
The speed of the Agrawal-Kayal-Saxena method depends on proven lower bounds for the size of the multiplicative semigroup generated by several polynomials modulo another polynomial
The main result (Theorem II.1) of [1] states a necessary and sufficient condition for the existence of the Minkowski unit in the totally real cyclic fields of degree p n..
For abstract numeration systems built on exponen- tial regular languages (including those coming from substitutions), we show that the set of real numbers having an ultimately
Dans cet article, on utilise des estimations de sommes de charact`eres pour ´etudier les produits de factorielles modulo
We show that there exist two canonical cut-and-project schemes associated with the β -numeration, allowing to lift up the β -integers to some points of the lattice Z m ( m = degree of
Abstract. The signless Laplacian separator of a graph is defined as the difference between the largest eigenvalue and the second largest eigenvalue of the associated signless
Representation of integers (or primes) by binary quadratic forms has an impor- tant role on the theory of numbers and many authors considered this problem.. In fact, this
