2766 search results - page 99 / 554 » Algorithms for trigonometric polynomials |
83
Voted
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in...
81
Voted
CSC
2006
15 years 2 months ago
2006
- The purpose of this paper is to develop an algorithm to determine the Hamilton Circuit in a given graph of degree three. This algorithm will find Hamilton Circuit in polynomial s...
IPL
2000
15 years 20 days ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
112
Voted
ORL
2008
15 years 24 days ago
2008
The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
122
Voted
CORR
2010
Springer
15 years 29 days ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...