1379 search results - page 30 / 276 » The Complexity of the Annihilating Polynomial |
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
IANDC
2010
14 years 8 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
MOC
2000
14 years 9 months ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...