290 search results - page 30 / 58 » Pseudorandom Bits for Polynomials |
ICCAD
1997
IEEE
14 years 21 days ago
1997
IEEE
We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specif...
ECCC
2010
13 years 8 months ago
2010
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
SIGCOMM
2012
ACM
11 years 11 months ago
2012
ACM
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...
SACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the ta...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...