共查询到6条相似文献,搜索用时 0 毫秒
1.
I. E. Shparlinski 《Computational Complexity》1992,2(2):129-132
A new deterministic algorithm is presented for testing whether a given polynomial of degreen over a finite field ofq elements is a permutation polynomial. The algorithm has computing time (nq)6/7+, and gives a positive answer to a question of Lidl and Mullen. 相似文献
2.
We study in this paper the use of consistency techniques and local propagation methods, originally developed for constraints over finite domains, for solving boolean constraints in Constraint Logic Programming (CLP). To this aim, we first present a boolean CLP language clp(B/FD) built upon a CLP language over finite domains clp(FD) which uses a propagation-based constraint solver. It is based on a single primitive constraint which allows the boolean solver to be encoded at a low level. The boolean solver obtained in this way is both very simple and very efficient: on average it is eight times faster than the CHIP propagation-based boolean solver, i.e. nearly an order of magnitude faster, and infinitely better than the CHIP boolean unification solver. It also performs on average several times faster than special-purpose stand-alone boolean solvers. We then present in a second time several simplifications of the above approach, leading to the design of a very simple and compact dedicated boolean solver. This solver can be implemented in a WAM-based logical engine with a minimal extension limited to four new abstract instructions. This clp(B) system provides a further factor two speedup w.r.t. clp(B/FD). 相似文献
3.
4.
d +1 variables over finite fields to scatter points on the surface of the unit sphere S
d
, d≥1. Applications are given for spherical t designs and generalized s energies.
Received May 2, 2001; revised October 2, 2001 Published online February 18, 2002 相似文献
5.
基于射影理论及新息分析方法,讨论离散随机线性系统最优化状态估计问题。提出了一种统一处理最优滤波、预报和平滑估计的的新方法,证明了新算法的渐近稳定性。 相似文献