10718 search results - page 520 / 2144 » On the Circuit Implementation Problem |
188
click to vote
FPL
2011
Springer
14 years 6 months ago
2011
Springer
—On-chip Physical Unclonable Functions (PUFs) are emerging as a powerful security primitive that can potentially solve several security problems. A PUF needs to be robust against...
171
click to vote
ESA
2003
Springer
16 years 9 days ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
175
click to vote
DAC
2009
ACM
16 years 8 months ago
2009
ACM
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
183
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
213
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...