1795 search results - page 265 / 359 » On the Complexity of Circuit Satisfiability |
112
Voted
CORR
2007
Springer
15 years 20 days ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
ATMOS
2010
14 years 11 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
104
Voted
IEEECIT
2010
IEEE
14 years 11 months ago
2010
IEEE
- The increase of embedded applications complexity has demanded hardware more flexible while providing higher performance. Reconfigurable architectures and stream processing have b...
79
Voted
TASLP
2010
14 years 11 months ago
2010
—The digital emulation of analog audio effects and synthesis components, through the simulation of lumped circuit components has seen a large amount of activity in recent years; ...
107
Voted
ACSD
2010
IEEE
14 years 10 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...