2168 search results - page 64 / 434 » Randomized Algorithms and Complexity Theory |
120
click to vote
SODA
2010
ACM
16 years 11 days ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
ICANN
2009
Springer
15 years 9 months ago
2009
Springer
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
118
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
123
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
132
click to vote
NIPS
2008
15 years 4 months ago
2008
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...