3 search results - page 1 / 1 » On the Construction of Small Fully Testable Circuits with Lo... |
DSD
2007
IEEE
13 years 11 months ago
2007
IEEE
During synthesis of circuits for Boolean functions area, delay and testability are optimization goals that often contradict each other. Multi-level circuits are often quite small ...
CRYPTO
2011
Springer
12 years 4 months ago
2011
Springer
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...