46 search results - page 3 / 10 » XPath evaluation in linear time with polynomial combined com... |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
83
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
90
Voted
ISSAC
1995
Springer
15 years 1 months ago
1995
Springer
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
A set of synchronization relations between distributed nonatomic events was recently proposed to provide real-time applications with a fine level of discrimination in the specifica...
123
click to vote
ECCC
2011
14 years 4 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...