27,497 research outputs found
Cyclotomy and permutation polynomials of large indices
We use cyclotomy to design new classes of permutation polynomials over finite
fields. This allows us to generate many classes of permutation polynomials in
an algorithmic way. Many of them are permutation polynomials of large indices
Algorithmic Polynomials
The approximate degree of a Boolean function is
the minimum degree of a real polynomial that approximates pointwise within
. Upper bounds on approximate degree have a variety of applications in
learning theory, differential privacy, and algorithm design in general. Nearly
all known upper bounds on approximate degree arise in an existential manner
from bounds on quantum query complexity. We develop a first-principles,
classical approach to the polynomial approximation of Boolean functions. We use
it to give the first constructive upper bounds on the approximate degree of
several fundamental problems:
- for the -element
distinctness problem;
- for the -subset sum problem;
- for any -DNF or -CNF formula;
- for the surjectivity problem.
In all cases, we obtain explicit, closed-form approximating polynomials that
are unrelated to the quantum arguments from previous work. Our first three
results match the bounds from quantum query complexity. Our fourth result
improves polynomially on the quantum query complexity of the
problem and refutes the conjecture by several experts that surjectivity has
approximate degree . In particular, we exhibit the first natural
problem with a polynomial gap between approximate degree and quantum query
complexity
ΠΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ ΡΠ°Π±Π»ΠΈΡ ΡΡΠ½ΠΊΡΠΈΠΉ Π΄Π»Ρ Π±ΡΡΡΡΠΎΠ³ΠΎ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΌΠ½ΠΎΠ³ΠΎΡΠ»Π΅Π½ΠΎΠ²
The table and algorithmic method of calculation of polynomials based on preliminary coefficient processing is offered. Possibility of acceleration of calculation of polynomials in comparison with realization of the well-known table and algorithmic methods is shown.ΠΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΡΠ°Π±Π»ΠΈΡΠ½ΠΎ-Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈΡΠ΅ΡΠΊΠΈΠΉ ΠΌΠ΅ΡΠΎΠ΄ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΌΠ½ΠΎΠ³ΠΎΡΠ»Π΅Π½ΠΎΠ², ΠΎΡΠ½ΠΎΠ²Π°Π½Π½ΡΠΉ Π½Π° ΠΏΡΠ΅Π΄Π²Π°ΡΠΈΡΠ΅Π»ΡΠ½ΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠ΅ ΠΊΠΎΡΡΡΠΈΡΠΈΠ΅Π½ΡΠΎΠ². ΠΠΎΠΊΠ°Π·Π°Π½Π° Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΡ ΡΡΠΊΠΎΡΠ΅Π½ΠΈΡ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΠΌΠ½ΠΎΠ³ΠΎΡΠ»Π΅Π½ΠΎΠ² ΠΏΠΎ ΡΡΠ°Π²Π½Π΅Π½ΠΈΡ Ρ ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΠ΅ΠΉ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΡ
ΡΠ°Π±Π»ΠΈΡΠ½ΠΎ-Π°Π»Π³ΠΎΡΠΈΡΠΌΠΈΡΠ΅ΡΠΊΠΈΡ
ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ²
Polar Varieties and Efficient Real Elimination
Let be a smooth and compact real variety given by a reduced regular
sequence of polynomials . This paper is devoted to the
algorithmic problem of finding {\em efficiently} a representative point for
each connected component of . For this purpose we exhibit explicit
polynomial equations that describe the generic polar varieties of . This
leads to a procedure which solves our algorithmic problem in time that is
polynomial in the (extrinsic) description length of the input equations and in a suitably introduced, intrinsic geometric parameter, called
the {\em degree} of the real interpretation of the given equation system .Comment: 32 page
- β¦