Sciweavers

32 search results - page 5 / 7
» Polynomial Interpolation of the Discrete Logarithm
Sort
View
CASES
2004
ACM
14 years 24 days ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
MOC
2002
135views more  MOC 2002»
13 years 7 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
JC
2000
135views more  JC 2000»
13 years 7 months ago
Decision Problems in Quadratic Function Fields of High Genus
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...
Renate Scheidler
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
ACNS
2006
Springer
167views Cryptology» more  ACNS 2006»
13 years 11 months ago
Public Key Cryptography Sans Certificates in Ad Hoc Networks
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
Nitesh Saxena