3208 search results - page 284 / 642 » A Lower Bound for Primality |
161
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
181
click to vote
FPGA
1999
ACM
15 years 11 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
152
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
177
click to vote
SIROCCO
2007
15 years 8 months ago
2007
A set of input vectors S is conclusive if correct functionality for all input vectors is implied by correct functionality over vectors in S. We consider four functionalities of co...
171
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...