1449 search results - page 34 / 290 » Self-Randomized Exponentiation Algorithms |
100
Voted
STOC
2007
ACM
16 years 24 days ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
103
Voted
STOC
2006
ACM
16 years 24 days ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
102
click to vote
STOC
2004
ACM
16 years 24 days ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
CHES
2007
Springer
15 years 6 months ago
2007
Springer
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
61
Voted
DAM
2010
15 years 17 days ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...