1806 search results - page 199 / 362 » Randomness and halting probabilities |
135
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
119
Voted
ICCAD
2003
IEEE
16 years 18 days ago
2003
IEEE
As current silicon-based techniques fast approach their practical limits, the investigation of nanoscale electronics, devices and system architectures becomes a central research p...
121
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
105
Voted
ISW
2009
Springer
15 years 10 months ago
2009
Springer
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
126
Voted
SLIP
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, a comprehensive and fast method is presented for the timing analysis of process variations on single-walled carbon nanotube (SWCNT) bundles. Unlike previous works t...