1677 search results - page 42 / 336 » On the Completeness of Quantum Computation Models |
180
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
180
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
193
click to vote
DAC
2008
ACM
15 years 7 months ago
2008
ACM
Graphene nanoribbon FETs (GNRFETs) are promising devices for beyond-CMOS nanoelectronics because of their excellent carrier transport properties and potential for large scale proc...
140
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
162
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper considers distributed systems, defined as a collection of components interacting through interfaces. Components, interfaces and distributed systems are modeled as Petri...