230 search results - page 6 / 46 » Faster algorithms for the characteristic polynomial |
MOC
1998
14 years 11 months ago
1998
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
AAAI
1993
15 years 1 months ago
1993
Formal AI systems traditionally represent knowledge using logical formulas. We will show, however, that for certain kinds of information, a modelbased representation is more compa...
ADG
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
163
click to vote
CP
2011
Springer
13 years 11 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
100
click to vote
PKC
2010
Springer
15 years 3 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...