356 search results - page 51 / 72 » Parallelizing time with polynomial circuits |
SIAMDM
1998
15 years 2 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
110
click to vote
ICCAD
2009
IEEE
15 years 21 days ago
2009
IEEE
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...
170
click to vote
NC
2011
14 years 10 months ago
2011
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
119
click to vote
CMS
2006
15 years 4 months ago
2006
At the Asiacrypt 2003 conference Billet and Gilbert introduce a block cipher, which, to quote them, has the following paradoxical traceability properties: it is computationally ea...
109
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...