34 search results - page 4 / 7 » Implicit Factoring: On Polynomial Time Factoring Given Only ... |
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
ISAAC
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
BMCBI
2006
13 years 7 months ago
2006
Background: Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), i...
AIPS
1996
13 years 8 months ago
1996
Subgoal interactions have received considerable attention in AI Planning. Earlier analyses by Korf [11] and Joslin and Roach [6] were done in terms of the topology of the space of...