2766 search results - page 168 / 554 » Algorithms for trigonometric polynomials |
131
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
139
click to vote
ATVA
2006
Springer
15 years 8 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
136
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
148
click to vote
AAAI
2006
15 years 5 months ago
2006
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
134
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...