3208 search results - page 219 / 642 » A Lower Bound for Primality |
130
click to vote
MFCS
2004
Springer
15 years 12 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
154
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
141
click to vote
MICRO
1999
IEEE
15 years 11 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
146
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
174
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...