1998 search results - page 55 / 400 » Complexity of the Cover Polynomial |
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
AISC
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
FSTTCS
2006
Springer
14 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
14 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
13 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...