900 search results - page 3 / 180 » On Polynomial Time Computation over Unordered Structures |
GECCO
2009
Springer
14 years 15 days ago
2009
Springer
CORR
2007
Springer
13 years 6 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...
STACS
2010
Springer
14 years 28 days ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
STACS
2007
Springer
14 years 2 days ago
2007
Springer
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...