98 search results - page 6 / 20 » Approximate counting in bounded arithmetic |
ANTS
2006
Springer
14 years 9 days ago
2006
Springer
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
BIRTHDAY
1997
Springer
14 years 22 days ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
ICASSP
2011
IEEE
13 years 8 days ago
2011
IEEE
Parameter trajectory generation for HMM-based speech synthesis is practically achieved using only fixed-point arithmetic with 32-bit integers. Since processors for embedded devic...
COCO
1993
Springer
14 years 20 days ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...