2766 search results - page 112 / 554 » Algorithms for trigonometric polynomials |
161
click to vote
IPL
2000
15 years 3 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
151
click to vote
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
107
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
118
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
148
click to vote
CPM
2008
Springer
15 years 5 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...