1802 search results - page 43 / 361 » Complexity Theory for Operators in Analysis |
166
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
167
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
153
click to vote
JCST
2010
14 years 11 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
141
click to vote
MOBIHOC
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
125
Voted
ISSAC
2004
Springer
15 years 10 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...