10988 search results - page 126 / 2198 » Algorithmic Folding Complexity |
132
Voted
MLG
2007
Springer
15 years 8 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Real-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more d...
118
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
120
Voted
COCO
1998
Springer
15 years 6 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
TIT
1998
15 years 2 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...