Sciweavers

80 search results - page 11 / 16
» On the Complexity of Real Root Isolation
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 10 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
BMCBI
2010
118views more  BMCBI 2010»
14 years 10 months ago
Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
Background: To understand the evolutionary role of Lateral Gene Transfer (LGT), accurate methods are needed to identify transferred genes and infer their timing of acquisition. Ph...
Sophie S. Abby, Eric Tannier, Manolo Gouy, Vincent...
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
15 years 1 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
COMPGEOM
2009
ACM
15 years 4 months ago
On the topology of planar algebraic curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
SIGMOD
2009
ACM
122views Database» more  SIGMOD 2009»
15 years 10 months ago
Finding min-repros in database software
Testing and debugging database system applications is often challenging and time consuming. A database tester (or DB tester for short) has to detect a problem, determine why it ha...
Nicolas Bruno, Rimma V. Nehme