1092 search results - page 34 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
173
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
101
click to vote
JSC
2008
14 years 11 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
112
click to vote
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...