86 search results - page 5 / 18 » Satisfiability Algorithms and Finite Quantification |
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
Consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A novel system, called the oscillator system, consisting of order of p 3 functions (signals) on the finite field p; with p an odd prime, is described and studied. The new functions...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Complex signal processing algorithms are often specified in floating point precision. Thus, a type conversion is needed when the targeted platform requires fixed-point precis...