11547 search results - page 39 / 2310 » Quantum computing and communication |
155
Voted
TCC
2004
Springer
15 years 10 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
130
Voted
SCN
2008
Springer
15 years 5 months ago
2008
Springer
114
Voted
PPL
2010
15 years 3 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
138
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
147
Voted
COCO
2004
Springer
15 years 10 months ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...