1795 search results - page 40 / 359 » On the Complexity of Circuit Satisfiability |
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
STOC
2009
ACM
14 years 3 months ago
2009
ACM
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
CONCUR
2005
Springer
14 years 2 months ago
2005
Springer
We propose a compositional approach to the dynamics of gene regulatory networks based on the stochastic π-calculus, and develop a representation of gene network elements which can...
ASYNC
1997
IEEE
14 years 7 days ago
1997
IEEE
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
ICCAD
1998
IEEE
14 years 28 days ago
1998
IEEE