1998 search results - page 57 / 400 » Complexity of the Cover Polynomial |
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
INFORMATICALT
2002
13 years 9 months ago
2002
It is shown that nonlinear Volterra, polynomial autoregressive, and bilinear filters have the same layered implementation procedure. Using the layered structure, the order of nonli...
SIAMNUM
2010
13 years 4 months ago
2010
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...